Related papers: Electronic Appendix to "Input Invariants"
Rejoinder to "The Future of Indirect Evidence" [arXiv:1012.1161]
We prove extension-dimensional versions of finite dimensional selection and approximation theorems. As applications, we obtain several results on extension dimension.
We propose a unified approach to addition of resistors and capacitors such that the formulae are always simply additive. This approach has the advantage of being consistent with the intuition of the students. To demonstrate our point of…
Machine learning models provide statistically impressive results which might be individually unreliable. To provide reliability, we propose an Epistemic Classifier (EC) that can provide justification of its belief using support from the…
In order for machine learning to garner widespread public adoption, models must be able to provide interpretable and robust explanations for their decisions, as well as learn from human-provided explanations at train time. In this work, we…
This is the arXiv index for the electronic proceedings of GD 2023, which contains the peer-reviewed and revised accepted papers with an optional appendix. Proceedings (without appendices) are also to be published by Springer in the Lecture…
These lecture notes provide a self-contained introduction to Euler integrals, which are frequently encountered in applications. In particle physics, they arise as Feynman integrals or string amplitudes. Our four selected topics demonstrate…
This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies.…
Discrete analogs of the index transforms, involving Bessel and the modified Bessel functions are introduced and investigated. The corresponding inversion theorems for suitable classes of functions and sequences are established.
These supplementary notes in the ArXiv are a companion to our paper "Bocher contractions of conformally superintegrable Laplace equations" [arXiv:1512.09315]. They contain background material and the details of the extensive computations…
We discuss Vassiliev invariants for virtual knots, expanding upon the theory of quantum virtual knot invariants developed in arXiv:1509.00578. In particular, following the theory of quantum invariants we work with 'rotational' virtual…
We propose a metric learning framework for the construction of invariant geometric functions of planar curves for the Eucledian and Similarity group of transformations. We leverage on the representational power of convolutional neural…
We introduce an algebraic structure we call semiquandles whose axioms are derived from flat Reidemeister moves. Finite semiquandles have associated counting invariants and enhanced invariants defined for flat virtual knots and links. We…
This paper addresses a significant gap in explainable AI: the necessity of interpreting epistemic uncertainty in model explanations. Although current methods mainly focus on explaining predictions, with some including uncertainty, they fail…
Software model checking is a challenging problem, and generating relevant invariants is a key factor in proving the safety properties of a program. Program invariants can be obtained by various approaches, including lightweight procedures…
There is a useful counterpart of conformal prediction for e-values, called conformal e-prediction. Conformal prediction can serve as basis for testing the assumption of exchangeability, leading to conformal testing. Similarly, conformal…
The invariant subspace method is refined to present more unity and more diversity of exact solutions to evolution equations. The key idea is to take subspaces of solutions to linear ordinary differential equations as invariant subspaces…
Invariants withstand transformations and, therefore, represent the essence of objects or phenomena. In mathematics, transformations often constitute a group action. Since the 19th century, studying the structure of various types of…
Context: Tertiary studies in software engineering (TS@SE) are widely used to synthesise evidence on a research topic systematically. As part of their protocol, TS@SE define inclusion and exclusion criteria (IC/EC) aimed at selecting those…
We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia…