Research
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

23466992 · Jun 202619922001200920172026
48 results for incorrect proofs

It was pointed out to us that the proof of a crucial lemma (Lemma 5.3) in the paper is incorrect. Thus the approximation theorem (Theorem 0.1) for L^2 torsion of an amenable covering of a finite simplicial complex remains unproved. However, results and proofs of the first four sections (in particular, the approximation…

2000-08-28abs ↗pdf ↗

A referee found an error in the proof of the Theorem 2 that we could not fix. More precisely, the proof of Lemma 2.1 is incorrect. Hence the fact that integer cohomology of complement of toric Weyl arrangements is torsion free is still a conjecture. ----- A toric arrangement is a finite set of hypersurfaces in a comple…

2010-08-03abs ↗pdf ↗

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.

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,…

2008-07-22abs ↗pdf ↗

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.

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…

2017-05-10abs ↗pdf ↗

It is shown that on a compact spin symmetric space with a Kähler or Quaternion-Kähler structure, the first eigenvalue of the Dirac operator is linked to a ''{lowest}'' action of the holonomy, given by the fiberwise action on spinors of the canonical forms characterized by this holonomy. The result is also verified for …

2014-07-08abs ↗pdf ↗

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.

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 …

2016-08-09abs ↗pdf ↗

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.

Paper introduces proof-of-learning to verify ML model training.

problem No mechanism to prove ML model training parameters were obtained through optimization.
method Inspired by proof-of-work and verified computations, introduces proof-of-learning mechanism.
result Proves model training parameters were obtained through optimization with minimal adversary work.

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.

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.

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.

The paper addresses private and Byzantine-proof cooperative decision-making in multi-agent systems.

problem Designing algorithms for multi-agent decision-making that are private and resilient to faulty agents.
method Upper-confidence bound algorithms for stochastic bandit problems under privacy and Byzantine conditions.
result Optimal regret achieved in both private and Byzantine-tolerant settings.

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.

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.

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.

2018-08-29abs ↗pdf ↗

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…

2017-10-30abs ↗pdf ↗

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.

2018-12-10abs ↗pdf ↗

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…

2018-06-15abs ↗pdf ↗

Characterizes regular parallelisms in 3D space with 2-torus action.

problem Characterizing regular parallelisms in 3D space with 2-torus action.
method Characterization using compactness, equivalence relations, and properties of complex vector spaces.
result There is a 1-dimensional subtorus fixing every parallel class, leading to 2- or 3-dimensional regular parallelisms.

The Frölicher spectral sequence of a compact complex manifold XX measures the difference between Dolbeault cohomology and de Rham cohomology. We construct for n2n\geq 2 nilmanifolds with left-invariant complex structure XnX_n such that the nn-th differential dnd_n does not vanish. This replaces an earlier incorrect e…

2007-09-04abs ↗pdf ↗

Study shows how to control jump-diffusion processes with stable feedback controls in reinforcement learning.

problem Control jump-diffusion processes with unknown coefficients in reinforcement learning.
method Lipschitz continuous optimal feedback controls, stability analysis of forward-backward SDEs, least-squares algorithm.
result Achieves O(NlnN)O(\sqrt{N\ln N}) regret for linear-convex learning problems with jumps.

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.