Incorrect fixed point assertions in digital topology are discussed.
problem Incorrect or poorly stated fixed point assertions in digital topology.
method Discussion of problematic publications in digital metric spaces.
result Clarification of incorrect fixed point assertions.
Incorrect fixed point assertions in digital topology are discussed.
problem Incorrect, incorrectly proven, or trivial fixed point assertions in digital topology.
method Continues earlier work on identifying and critiquing bad fixed point assertions.
result Clarifies the nature and extent of incorrect fixed point assertions in digital topology.
Fixed point assertions in digital topology are often incorrect or poorly stated.
problem Fixed points in digital metric spaces
method Discussing publications with bad assertions
result Identifying and correcting errors in fixed point assertions
Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.
problem Incorrect descriptions of realizable Gauss diagrams using parity conditions.
method Used bipartite graphs to describe realizable Gauss diagrams.
result Realizable Gauss diagrams can be accurately described using bipartite graphs.
Critiques incorrect fixed point assertions in digital topology.
problem Incorrect or incorrectly proven fixed point assertions in digital topology.
method Critical review of existing assertions.
result Identifies and critiques incorrect fixed point assertions.
Corrects incorrect assertions about fixed points in digital topology.
problem Incorrect or incorrectly proven assertions about fixed points in digital metric spaces.
method Analysis of existing assertions and proofs.
result Identifies and corrects errors in published assertions.
Deep and narrow neural networks can collapse to incorrect states.
problem The collapse of deep and narrow neural networks to incorrect states.
method Numerical and theoretical analysis of deep and narrow neural networks with ReLU activation.
result Deep and narrow neural networks can converge to erroneous mean or median states with high probability.
Incorrect fixed point results in digital topology are corrected.
problem Incorrect fixed point results in digital topology.
method Analysis of recent papers in digital topology.
result Corrected incorrect conclusions in fixed point results.
The Morse-Bott inequalities relate the topology of a closed manifold to the topology of the critical point set of a Morse-Bott function defined on it. The Morse-Bott inequalities are sometimes stated under incorrect orientation assumptions. We show that these assumptions are insufficient with an explicit counterexample…
The paper corrects and improves previous assertions in digital topology.
problem Incorrect or poorly proven assertions in digital topology.
method Review and correction of existing assertions.
result Improved and corrected assertions in digital topology.
Study shows AD for neural nets with machine-representable numbers can be incorrect.
problem Correctness of AD for neural nets with machine-representable numbers.
method Analyzed two sets of parameters: incorrect and non-differentiable. Proved bounds and conditions for AD correctness.
result AD can be incorrect for machine-representable numbers, but provides a Clarke subderivative on non-differentiable set.
Develops a theory for equivariant networks with partial domain symmetry.
problem Limited analysis of equivariant networks with partial domain symmetry.
method Proposes pointwise definitions of correct, incorrect, and extrinsic equivariance.
result Establishes error lower bounds for networks with partial symmetry.
Paper finds previous work on submanifolds incorrect.
problem Incorrect definition of semi-invariant submanifolds.
method Examined previous work's definition and found it flawed.
result Previous results on semi-invariant submanifolds are invalid.
Incorrect fixed point results in digital topology are debunked.
problem Incorrect fixed point results in digital topology.
method Mimicking classical topology tools.
result Many recent fixed point results are incorrect or trivial.
This paper improves loss functions for deep learning with noisy labels.
problem Training deep neural networks with noisy labels.
method The paper introduces a normalization technique to make any loss function robust to noisy labels and proposes a framework called Active Passive Loss (APL) to combine robust loss functions.
result The proposed APL framework consistently outperforms state-of-the-art methods, especially under high noise rates.
Fine-tuning neural networks to guarantee performance on specific examples can also introduce incorrect inputs.
problem Ensuring reliable performance of neural networks on specific examples.
method Using SMT solvers to fine-tune ReLU neural networks to guarantee outcomes on a finite set of particular examples.
result Fine-tuning can introduce incorrect inputs that trigger unexpected performance.
This paper was withdrawn as Lemma 2 is incorrect.
Withdrawn by the authors, the main theorem is incorrect
Study on numerical reliability of AD for MaxPool in neural nets.
problem Reliability of automatic differentiation for nonsmooth operations like MaxPool.
method Investigation across precision levels and architectures on various datasets.
result Lower norms of nonsmooth Jacobians help maintain stable learning.
This paper is not ready for public consumption, as the last step (Figure 20) is incorrect.
Paper classifies brain signals using eigenvalues for 2D and 3D educational content questions.
problem Classifying brain signals for 2D and 3D educational content questions.
method Eigenvalues of covariance matrix used as features; KNN and SVM classifiers applied.
result No significant difference in learning, memory retention, and recall between 2D and 3D educational content.
Section 1.3 was incorrect, and 2.1 will be removed from further submissions. A rewritten version will be posted in the future.
This paper presents an automated supervised method for Persian wordnet construction. Using a Persian corpus and a bi-lingual dictionary, the initial links between Persian words and Princeton WordNet synsets have been generated. These links will be discriminated later as correct or incorrect by employing seven features …
CrossFilter tackles noisy labels in audio tagging.
problem Noisy labels in large audio datasets.
method CrossFilter framework using multiple representations and multi-task learning.
result Improves audio tagging performance on FSDKaggle2018 and FSDKaggle2019 datasets.
Paper proposes methods to learn with multiple incorrect labels per example.
problem Learning with a single incorrect label per example limits potential.
method Proposes a novel problem setting allowing multiple incorrect labels per example and two learning methods.
result Demonstrates improved learning with multiple incorrect labels compared to single incorrect labels.
Self-training improves neural sequence generation by correcting incorrect predictions.
problem Improving neural sequence generation models using unlabeled data.
method Injecting pseudo-parallel data (model predictions) into the labeled dataset and using dropout as a regularizer.
result Noisy self-training significantly improves performance on machine translation and text summarization benchmarks.
Paper addresses incorrectness of nearest neighbor in ranking models.
problem Incorrectness of nearest neighbor in ranking models.
method Introducing new algorithms with features constructed from 'global' and 'local' information.
result New algorithms provide correct neighbor identification in ranking models.
Manifold Mixup improves neural network robustness by interpolating hidden states.
problem Neural networks' incorrect predictions on slightly different test examples.
method Manifold Mixup, a regularizer that encourages less confident predictions on interpolations of hidden representations.
result Neural networks trained with Manifold Mixup learn smoother decision boundaries and fewer directions of variance.
A minimalist approach improves LLM reasoning by filtering incorrect responses.
problem Improving large language model (LLM) reasoning on complex tasks.
method Revisit GRPO from a reinforce-like algorithm perspective, proposing Reinforce-Rej.
result RAFT, a simple rejection sampling baseline, outperforms GRPO and PPO.
Paper tackles label insufficiency and inaccuracy in semi-supervised learning.
problem Label insufficiency and inaccuracy in semi-supervised learning.
method Graph-based propagation for label insufficiency and label filtering for inaccuracy.
result SIIS improves performance in the presence of label noise and scarcity.
Improves estimation under model misspecification with fake features.
problem Model misspecification with fake features.
method Proposes a framework to decompose output error into underlying, fake, and missing features.
result Fake features can significantly improve estimation performance, even when not correlated with underlying features.
The Comment cond-mat/0503325 is built around two core statements, both of which are plainly incorrect.
New method reduces state redundancy in HSMM for driving patterns.
problem Overestimation of states in HSMM models.
method Robust HDP-HSMM (rHDP-HSMM) method to reduce redundant states.
result Improved consistency and accurate inference of driving maneuvers.
New partial models correct for confounding effects in reinforcement learning.
problem Confounding effects in partial models lead to incorrect planning.
method Introduces causally correct partial models for reinforcement learning.
result Causally correct partial models avoid confounding effects and improve planning accuracy.
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.
Machine learning models are often susceptible to adversarial perturbations of their inputs. Even small perturbations can cause state-of-the-art classifiers with high "standard" accuracy to produce an incorrect prediction with high confidence. To better understand this phenomenon, we study adversarially robust learning …
Simple method improves deep learning with noisy labels.
problem Deep learning's overfitting to noisy labels.
method Adds a variance regularization term to penalize neural network's Jacobian norm.
result Achieves state-of-the-art performance with high noise tolerance.
New approach identifies and explains errors in machine learning pipelines.
problem Challenges in identifying and explaining errors in complex machine learning pipelines.
method Uses iteration and provenance to automatically infer root causes of failures.
result Significantly improves precision and recall compared to state-of-the-art methods.
QR-MIX models joint state-action values as a distribution to handle randomness in MARL.
problem Randomness in rewards and observations leads to randomness in long-term returns in MARL.
method QR-MIX uses quantile regression and combines it with QMIX and IQN to model joint state-action values as a distribution.
result QR-MIX outperforms QMIX in the StarCraft Multi-Agent Challenge (SMAC) environment.
New approach detects out-of-distribution inputs without needing OOD samples.
problem Detecting incorrect classification of out-of-distribution inputs in deep neural networks.
method A one-class classifier trained on an early layer's output of the original classifier.
result Substantially better results compared to state-of-the-art approaches.
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…
Corrects errors in previous work on linear elasticity calculations.
problem Incorrect formulas and conclusions in previous research on linear elasticity.
method Identifying and correcting errors in previous calculations and conclusions.
result Proves the correctness of the main theorem in a previous paper.
Paper warns of metric deformation in manifold learning, leading to incorrect answers.
problem Metric deformation in manifold learning.
method Analysis of manifold learning techniques.
result Metric deformation can lead to incorrect answers in manifold learning.
Research disproves Matsumoto's length conjecture using indicatrix geometry.
problem Matsumoto's conjecture about relative and Finsler lengths.
method Analysis of indicatrix geometry to refute the conjecture.
result Matsumoto's inequality between relative and Finsler lengths is false.
Improved proofs for topological and smooth pseudo-isotopies of simply connected 4-manifolds.
problem Proving topological and smooth pseudo-isotopies of simply connected 4-manifolds.
method Provided different arguments that bypass the replacement criterion, thus completing Quinn's proofs.
result Corrected and completed Quinn's proofs of both topological and stable smooth pseudo-isotopy theorems.
A deep learning framework discovers causal relationships from incomplete data.
problem Discovering causal knowledge from incomplete observational data.
method Imputated Causal Learning (ICL) framework for iterative missing data imputation and causal structure discovery.
result ICL outperforms state-of-the-art methods in various missing data scenarios.
Missing data and noisy observations pose significant challenges for reliably predicting events from irregularly sampled multivariate time series (longitudinal) data. Imputation methods, which are typically used for completing the data prior to event prediction, lack a principled mechanism to account for the uncertainty…
This is a brief technical note to clarify the state of lower bounds on regret for reinforcement learning. In particular, this paper: - Reproduces a lower bound on regret for reinforcement learning, similar to the result of Theorem 5 in the journal UCRL2 paper (Jaksch et al 2010). - Clarifies that the proposed proof of …