arXiv research

Develops a theory for equivariant networks with partial domain symmetry.

Critiques incorrect fixed point assertions in digital topology.

Corrects incorrect assertions about fixed points in digital topology.

Incorrect fixed point assertions in digital topology are discussed.

Incorrect fixed point assertions in digital topology are discussed.

Fine-tuning neural networks to guarantee performance on specific examples can also introduce incorrect inputs.

New partial models correct for confounding effects in reinforcement learning.

The paper corrects and improves previous assertions in digital topology.

Study shows AD for neural nets with machine-representable numbers can be incorrect.

Study on numerical reliability of AD for MaxPool in neural nets.

Paper warns of metric deformation in manifold learning, leading to incorrect answers.

Paper finds previous work on submanifolds incorrect.

A minimalist approach improves LLM reasoning by filtering incorrect responses.

Fixed point assertions in digital topology are often incorrect or poorly stated.

Deep-MIL models fail to respect key MIL assumption, leading to incorrect learning.

This paper was withdrawn as Lemma 2 is incorrect.

An active learner is given a hypothesis class, a large set of unlabeled examples and the ability to interactively query labels to an oracle of a subset of these examples; the goal of the learner is to learn a hypothesis in the class that fits the data well by making as few label queries as possible. This work addresses…

Withdrawn by the authors, the main theorem is incorrect

Machine learning offers novel ways and means to design personalized learning systems wherein each student's educational experience is customized in real time depending on their background, learning goals, and performance to date. SPARse Factor Analysis (SPARFA) is a novel framework for machine learning-based learning a…

This paper is not ready for public consumption, as the last step (Figure 20) is incorrect.

Section 1.3 was incorrect, and 2.1 will be removed from further submissions. A rewritten version will be posted in the future.

In this paper, we have proposed a brain signal classification method, which uses eigenvalues of the covariance matrix as features to classify images (topomaps) created from the brain signals. The signals are recorded during the answering of 2D and 3D questions. The system is used to classify the correct and incorrect a…

This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with $n$ agents (users) $\{x_i\}_{i \in [n]}$ and $m$ alternatives (items) $\{y_j\}_{j \in [m]}$, each of which is associated with a latent feat…

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

This paper improves loss functions for deep learning with noisy labels.

We explore adversarial robustness in the setting in which it is acceptable for a classifier to abstain---that is, output no class---on adversarial examples. Adversarial examples are small perturbations of normal inputs to a classifier that cause the classifier to give incorrect output; they present security and safety …

System predicts ice formation to improve road safety.

CrossFilter tackles noisy labels in audio tagging.

New research shows calibration error is flawed when dealing with model uncertainty.

I show that Matsumoto conjectured inequality between relative length and Finsler length is false. The incorrectness of the claim is easily inferred from the geometry of the indicatrix.

Practically, we are often in the dilemma that the labeled data at hand are inadequate to train a reliable classifier, and more seriously, some of these labeled data may be mistakenly labeled due to the various human factors. Therefore, this paper proposes a novel semi-supervised learning paradigm that can handle both l…

The Comment cond-mat/0503325 is built around two core statements, both of which are plainly incorrect.

Classifier chains are popular and effective method to tackle a multi-label classification problem. The aim of this paper is to study the asymptotic properties of the chain model in which the conditional probabilities are of the logistic form. In particular we find conditions on the number of labels and the distribution…

Improves estimation under model misspecification with fake features.

The results in the recently posted manuscript arXiv:math/0405153v3 are incorrect. The correct version of the aimed results is not original. The preprint contains material from references that are not properly quoted.

Paper shows incorrectness of approximate unlearning definitions and challenges exact unlearning verification.

We study active learning where the labeler can not only return incorrect labels but also abstain from labeling. We consider different noise and abstention conditions of the labeler. We propose an algorithm which utilizes abstention responses, and analyze its statistical consistency and query complexity under fairly nat…

Study shows resampling labels improves classifier performance in noisy data.

In a recent paper, "Why does deep and cheap learning work so well?", Lin and Tegmark claim to show that the mapping between deep belief networks and the variational renormalization group derived in [arXiv:1410.3831] is invalid, and present a "counterexample" that claims to show that this mapping does not hold. In this …

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces. We show that in many cases, researchers using these tools have derived conclusions that are incorrect, trivial, or limited.

This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the i…

We point out an issue with Theorem 5 appearing in "Group-based active query selection for rapid diagnosis in time-critical situations". Theorem 5 bounds the expected number of queries for a greedy algorithm to identify the class of an item within a constant factor of optimal. The Theorem is based on correctness of a re…

Corrects errors in previous work on linear elasticity calculations.

Paper develops Byzantine-resilient algorithms for decentralized learning.

Dual Variable Learning Rates improve neural network training efficiency.

We continue the work of [5] and [3], in which are considered papers in the literature that discuss fixed point assertions in digital topology. We discuss published assertions that are incorrect or incorrectly proven; that are severely limited or reduce to triviality under "usual" conditions; or that we improve upon.

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases, researchers using these tools have derived conclusions that are incorrect or tr…

We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achi…