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.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “incorrect definition”
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 shows incorrectness of approximate unlearning definitions and challenges exact unlearning verification.
problem Incorrectness of approximate unlearning definitions and challenges in verifying exact unlearning.
method Analysis of machine unlearning approaches, including exact and approximate methods.
result Unlearning is only well-defined at the algorithmic level, and auditable claims are limited.
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.
Reshef et al. recently proposed a new statistical measure, the "maximal information coefficient" (MIC), for quantifying arbitrary dependencies between pairs of stochastic quantities. MIC is based on mutual information, a fundamental quantity in information theory that is widely understood to serve this need. MIC, howev…
New framework for contesting algorithmic decisions, not just explaining them.
problem Helping individuals review and correct erroneous algorithmic decisions.
method Operationalized contestability as a natural complement to explainable AI (XAI), identifying three types of evidence for reversal.
result Existing EU legislation already grants individuals legal rights to contest algorithmic decisions.
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.
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.
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
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.
A Fake $CP^2 #4 {\bar CP^2}$math.GT
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.
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.
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.
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.
The Comment cond-mat/0503325 is built around two core statements, both of which are plainly incorrect.
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 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.
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.
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…
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.
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…
The Frölicher spectral sequence of a compact complex manifold measures the difference between Dolbeault cohomology and de Rham cohomology. We construct for nilmanifolds with left-invariant complex structure such that the -th differential does not vanish. This replaces an earlier incorrect e…
E-scores assess LLM outputs for correctness, addressing p-hacking issues.
problem Limited principled mechanisms to assess generative model correctness.
method Use e-values to complement LLM outputs with e-scores, providing flexibility in tolerance levels.
result Achieves guarantees of correctness assessment and upper bounds size distortion.
We study Bayesian discriminative inference given a model family $p(c,\x, θ)$ that is assumed to contain all our prior information but still known to be incorrect. This falls in between "standard" Bayesian generative modeling and Bayesian regression, where the margin $p(\x,θ)$ is known to be uninformative about $p(c|\x,…
Deep-MIL models fail to respect key MIL assumption, leading to incorrect learning.
problem Deep-MIL models learn anti-correlated instances, violating the standard MIL assumption.
method Proposed algorithmic unit tests to identify violations of MIL assumptions.
result Five prominent deep-MIL models fail algorithmic unit tests, revealing incorrect learning.
Ogburn et al. (2019, arXiv:1910.05438) discuss "The Blessings of Multiple Causes" (Wang and Blei, 2018, arXiv:1805.06826). Many of their remarks are interesting. But they also claim that the paper has "foundational errors" and that its "premise is...incorrect." These claims are not substantiated. There are no foundatio…
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…
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 agents (users) and alternatives (items) , each of which is associated with a latent feat…
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…
Formalizes weak and strong verification for LLMs, controlling errors without assumptions.
problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.
Research on interference has provided evidence that the formation of dependencies between non-adjacent words relies on a cue-based retrieval mechanism. Two different models can account for one of the main predictions of interference, i.e., a slowdown at a retrieval site, when several items share a feature associated wi…
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 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.
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…
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 …
The Kropholler Conjecturemath.GR
Corrects a flawed proof of the Kropholler Conjecture.
problem Kropholler Conjecture in relative group theory.
method Explains the flaws and proposes possible ways to correct the proof.
result Provides a clearer understanding of the conjecture's proof difficulties.
It has been pointed out to the author by David Glickenstein that the proof of the (closely related) Lemmas 1.2 and 3.2 in the title paper is incorrect. The statements of both Lemmas are correct, and the purpose of this note is to give a correct argument. The argument is of some interest in its own right.
This paper defines resilience in knowledge graph embeddings and surveys existing works.
problem Challenges in knowledge graph embedding models, including noise, missing information, distribution shift, and adversarial attacks.
method Unified definition of resilience, formalization in the context of knowledge graphs, systematic survey of existing works.
result Most existing works focus on robustness, leaving other aspects of resilience unexplored.