Improves reliability diagrams for probabilistic forecasts.
problem Lack of stability in reliability diagrams hampered their use.
method CORP approach using non-parametric isotonic regression and PAV algorithm.
result Improved reliability diagrams with statistical consistency and reproducibility.
Proposes and evaluates three diagnostic graphics for probabilistic classifiers.
problem Evaluating and comparing probabilistic classifiers.
method Triptych of diagnostic graphics: reliability diagram, ROC curve, Murphy diagram.
result Visual diagnostics reveal distinct aspects of forecast performance.
Plots show miscalibration directly as slopes of secant lines.
problem Detecting discrepancies between probabilistic predictions and actual outcomes.
method Cumulative differences between observed and expected values displayed as slopes of secant lines.
result Directly shows miscalibration without binning or kernel density estimation.
Feature extraction from persistence diagrams, as a tool to enrich machine learning techniques, has received increasing attention in recent years. In this paper we explore an adaptive methodology to localize features in persistent diagrams, which are then used in learning tasks. Specifically, we investigate three algori…
TCE measures calibration error with a test-based approach.
problem Measuring calibration error of probabilistic binary classifiers.
method TCE uses a novel loss function based on a statistical test.
result TCE offers clear interpretation, consistent scale, and enhanced visual representation.
New methods for better uncertainty prediction in ML.
problem Insufficient calibration in machine learning regression.
method Conditional calibration with respect to input features (adaptivity).
result Consistency and adaptivity are complementary, and good consistency does not guarantee good adaptivity.
Study detects P-type bifurcations in single system realizations using unreliable kernel density estimates.
problem Detecting P-type bifurcations in signals with unreliable kernel density estimates.
method Create persistence diagrams from single system realization, statistically analyze resulting set, compare point process modeling methods.
result Subsampling outperforms other point process modeling methods in predicting P-type bifurcations.
Reassesses calibration metrics in machine learning models.
problem Inconsistent reporting of calibration metrics in recent literature.
method Calibration-based decomposition of Bregman divergences, visualization of calibration and generalization error.
result New visualization technique for detecting trade-offs between calibration and generalization.
A quantum model classifies financial sentiment by mapping text chunks to quantum circuits.
problem Classifying financial texts with high accuracy and preserving semantic information.
method Chunked diagrams are mapped to quantum circuits, with a Transformer encoder and type embeddings added for context.
result The hybrid model improves sentiment classification over a simple averaging baseline.
This study revisits UQ validation methods based on consistency and adaptivity concepts.
problem Lack of comprehensive validation methods for UQ metrics across input feature ranges.
method Revisit and extend common validation methods for UQ metrics based on consistency and adaptivity concepts.
result Improved understanding and capabilities of UQ metrics validation methods.
EBM improves car insurance claim severity and frequency prediction while maintaining interpretability.
problem Balancing predictive accuracy and interpretability in insurance claim modeling.
method Combines GAM and cyclic gradient boosting, providing interpretable predictions.
result EBM outperforms benchmark models in claim severity and frequency prediction.
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
problem Investigating transformations and deformations of lattice diagrams and their associated dotted diagrams.
method Introducing dotted diagrams and investigating deformations of these diagrams, relating them to transformations of lattice diagrams.
result Refined results on the relation between deformations of admissible dotted diagrams and transformations of lattice diagrams.
This note explains how to transform Heegaard diagrams into framed link diagrams.
problem No specific problem stated; transformation of diagrams is the focus.
method Explains a procedure to transform Heegaard diagrams into framed link diagrams.
result Demonstrates a method to transform Heegaard diagrams into framed link diagrams.
New minimal link diagrams found, including torus links and homogeneous ones.
problem Finding minimal link diagrams with new classes.
method Morton-Franks-Williams inequality approach.
result New classes of minimal link diagrams, including previously unproven ones.
New method estimates causal effects in complex spaces using topological structures.
problem Challenges in estimating causal effects in non-Euclidean spaces.
method Developed a topological causal inference framework using power-weighted silhouette functions of persistence diagrams.
result Successfully quantifies topological treatment effects across various complex outcomes.
Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.
problem Creating efficient trisection diagrams for 4-manifolds.
method Algorithm converting Kirby diagrams to trisection diagrams.
result Provides examples of trisection diagrams for 4-manifolds.
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …
Study categorizes knots and links as rigid or shaky based on Reidemeister moves.
problem Classifying knots and links as rigid or shaky based on adaptability to Reidemeister moves.
method Categorization of hard diagrams as rigid or shaky, investigation of rigid and shaky hard diagrams for specific knots and links.
result Every link has a rigid hard diagram, and there is an upper limit for the number of crossings in such diagrams.
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …
Problems on region choices for knot and link diagrams solved using Alexander numbering.
problem Existence of solutions for region choice problems on knot and link diagrams.
method Alexander numbering for regions, alternative proofs, necessary and sufficient conditions.
result Existence of solutions for region choice problems on link diagrams.
Table of symmetric diagrams for knots up to 10 crossings.
problem Finding symmetric diagrams for strongly invertible knots.
method Compilation of symmetric diagrams for knots up to 10 crossings.
result Similarity of transversal diagrams to symmetric union diagrams for strongly invertible knots.
Probabilistic classifiers output a probability distribution on target classes rather than just a class prediction. Besides providing a clear separation of prediction and decision making, the main advantage of probabilistic models is their ability to represent uncertainty about predictions. In safety-critical applicatio…
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…
Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.
Rectangular diagrams help analyze foliations in 3-sphere.
problem Analyzing foliations in 3-sphere complements.
method Introduced rectangular diagrams for foliations and links.
result Any co-orientable finite depth foliation can be presented by a compatible rectangular diagram.
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…
The paper explores when specific knot operations simplify diagrams.
problem Understanding when arc crossing changes simplify knot diagrams.
method Examined two types of arc crossing changes on link diagrams and determined when they are unknotting operations.
result Any two crossing points in an alternating knot diagram are arc crossing change admissible.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.
New estimate of semimeander complexity for knots with more than 10 crossings.
problem Estimating the complexity of semimeander diagrams of knots.
method Proved a new upper bound on the number of crossings for semimeander diagrams of knots with more than 10 crossings.
result For knots with more than 10 crossings, semimeander diagrams have no more than 0.31⋅1.558cr(K) crossings. Paper proves link diagrams can be realized for some but not all types of links.
problem Realizing link diagrams for different types of links.
method Analyzing link diagrams for welded and virtual links.
result Similar results hold for welded links but not for virtual links.
GridPyM handles grid diagrams for knot theory.
problem Handling grid diagrams for knot theory.
method Generates and simplifies grids, models local transformations.
result Models local transformations between grid diagrams.
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
problem Improving inequalities for link diagrams and understanding their properties.
method Introducing weak rectangular diagrams and proving new inequalities.
result Generalizes and subsumes many known inequalities related to multi-crossing numbers.
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…
Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
problem Recognizing and performing Reidemeister moves in Gauss diagrams.
method Simple algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
result Simple algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
Standard trisection diagrams found for Mazur type 4-manifolds.
problem Finding standard trisection diagrams for Mazur type 4-manifolds.
method Doubling a relative trisection diagram and using an algorithm from Kirby diagrams to trisection diagrams.
result Certain trisection diagrams of Mazur type 4-manifolds are standard.
By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …
Minimal grid diagrams for 12-crossing prime knots identified.
problem Identifying minimal grid diagrams for prime knots.
method Listed minimal grid diagrams for 12-crossing prime knots.
result Provided a list of minimal grid diagrams for 12-crossing prime knots.
The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.
problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2 under certain conditions. Complete criterion for VoI in multi-decision influence diagrams established.
problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.
A virtual link diagram is called mod m almost classical if it admits an Alexander numbering valued in integers modulo m, and a virtual link is called mod m almost classical if it has a mod m almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod m almost class…
Algorithm constructs Kirby diagrams for 4D open books.
problem Constructing Kirby diagrams for 4D open books.
method Algorithm using Heegaard diagrams of pages.
result Diffeomorphic open books constructed with different pages and monodromies.
Study minimum ribbonlength of immersed flat knots and links.
problem Finding the minimum ribbonlength for immersed planar knots and links.
method Embedding into disk diagram space to find length minimizers.
result Computed minimal ribbonlength for some knot and link diagrams.
For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the span of the f-polynomial of an alternating virtual link L is determined by the nu…
Study shows that splitting links requires an arbitrarily large number of extra crossings.
problem The problem is to determine the minimum number of extra crossings needed to transform a diagram of a split link into a split diagram.
method The approach uses Reidemeister moves and the framework of bubble tangles, along with techniques from Riemannian geometry.
result There exist split links with diagrams requiring an arbitrarily large number of extra crossings.