Related papers: How the no-cloning theorem got its name
We propose a method for certifying the fairness of the classification result of a widely used supervised learning algorithm, the k-nearest neighbors (KNN), under the assumption that the training data may have historical bias caused by…
We explore the problem of binary classification in machine learning, with a twist - the classifier is allowed to abstain on any datum, professing ignorance about the true class label without committing to any prediction. This is directly…
We prove three conjectures, related to the paperfolding sequence, in a recent paper [arXiv:2005.04066] of P. Barry.
Faced with a sequence of N binary events, such as coin flips (or Ising spins), it is natural to ask whether these events reflect some underlying dynamic signals or are just random. Plausible models for the dynamics of hidden biases lead to…
Statistical analysis of repeat misprints in scientific citations leads to the conclusion that about 80% of scientific citations are copied from the lists of references used in othe papers. Based on this finding a mathematical theory of…
Convolutional neural networks (CNNs) are widely used state-of-the-art computer vision tools that are becoming increasingly popular in high energy physics. In this paper, we attempt to understand the potential of CNNs for event…
The advent of ML-driven decision-making and policy formation has led to an increasing focus on algorithmic fairness. As clustering is one of the most commonly used unsupervised machine learning approaches, there has naturally been a…
Counterfactual explanations are considered, which is to answer {\it why the prediction is class A but not B.} Different from previous optimization based methods, an optimization-free Fast ReAl-time Counterfactual Explanation (FRACE)…
The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the…
This paper has been withdrawn due to a critical error discovered in Theorem 4.21. Anyone with a historical or pragamatic interest in prior "negative results", however - e.g., failed proof attempts relating to the (in)consistency of ZF or…
Arising from the Article: Nature Phys. 2, 620-625 (2006), By M. I. Katsnelson, K. S. Novoselov, and A. K. Geim.
The No Free Lunch (NFL) theorem for search and optimisation states that averaged across all possible objective functions on a fixed search space, all search algorithms perform equally well. Several refined versions of the theorem find a…
In our recent paper [Phys. Rev. B 65, 075316 (2002)], the selection rules for the Raman scattering in spherical nanocrystals are analyzed. Here we show, that a physically expedient choice of the coordinate system, related to the…
Fairness studies of algorithmic decision-making systems often simplify complex decision processes, such as bail or loan approvals, into binary classification tasks. However, these approaches overlook that such decisions are not inherently…
Based on historical facts, revisited from a present-day perspective, and on the documented opinions of the scientists involved in the discovery themselves, strong arguments are given in favor of a proposal to include prominent astronomer…
This paper has been withdrawn by the authors, due to a possible flaw in its logic. Namely, it has been taken for granted that the the structure of regular part of Helmholtz free energy is insensitive to the sign of the specific heat…
All proper scoring rules incentivize an expert to predict \emph{accurately} (report their true estimate), but not all proper scoring rules equally incentivize \emph{precision}. Rather than treating the expert's belief as exogenously given,…
Numerous algorithms have been produced for the fundamental problem of clustering under many different notions of fairness. Perhaps the most common family of notions currently studied is group fairness, in which proportional group…
A new criterion of comprehension is defined, initially termed by myself as "connected" and finally as "Acyclic" by Mr. Randall Holmes. Acyclic comprehension simply asserts that for any acyclic formula phi, the set {x:phi} exists. I first…
Some of my previous publications were incomplete in the sense that non trivial zeros belonging to a particular type of fundamental domain have been inadvertently ignored. Due to this fact, I was brought to believe that computations done by…