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.

169,051 papers · 148 categories

Trend · papers per month

8152330 · Jun 202019922001200920182026
48 results for incorrect conclusions

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 ↗

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

problem Current model evaluation techniques conflate model uncertainty with aleatoric uncertainty.
method Posterior predictive checks to evaluate deep learning models.
result Calibration error and variants are incorrect when model uncertainty is present.

Explainable AI improves human decision accuracy but does not enhance it significantly.

problem Improving human decision-making through explainable AI.
method Comparing human decision accuracy with and without AI predictions, including or excluding explanations.
result Providing AI predictions improves human decision accuracy, but explanations do not significantly enhance it.

The paper introduces a model to measure ASR fairness, addressing key issues.

problem Measuring fairness in ASR systems for different subgroups.
method Mixed-effects Poisson regression to control nuisance factors and handle unobserved heterogeneity.
result The method effectively addresses WER gaps among subgroups and is flexible for practical analyses.

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 discusses methods for interval estimation of coefficients in penalized regression models for insurance data.

problem Valid inference on coefficients after feature selection in GLM family for insurance data.
method Proposes methodologies for constructing confidence intervals of coefficients after feature selection in GLM family.
result Valid inference on coefficients after feature selection in GLM family for insurance data.

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.

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.

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.

Decision trees can be biased towards minority class, contrary to belief.

problem Bias in decision trees towards minority class in imbalanced datasets.
method Critical evaluation of past literature, specific conditions analysis, tree-fitting adjustments, and post-hoc calibration methods.
result Decision trees can be biased towards minority class under specific conditions, not always towards majority.

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.

Over the past two decades, several consistent procedures have been designed to infer causal conclusions from observational data. We prove that if the true causal network might be an arbitrary, linear Gaussian network or a discrete Bayes network, then every unambiguous causal conclusion produced by a consistent method f…

2012-03-15abs ↗pdf ↗

Deep learning models are evaluated for sensory information processing.

problem Unclear interpretation of model comparison techniques for DNNs.
method Explicitly define conclusions from existing model comparison techniques.
result Stronger conclusions about sensory processing mechanisms possible with DNNs.

Choosing a reference group in Oaxaca-Blinder decomposition can reverse conclusions.

problem The choice of reference group in Oaxaca-Blinder decomposition can lead to different conclusions.
method The study uses the Oaxaca-Blinder decomposition to investigate how the choice of reference group affects the results.
result The Oaxaca-Blinder decomposition can yield different conclusions based on the choice of reference group.

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.

Work shows hallucination detection by LLMs is impossible without expert feedback.

problem Detecting hallucinations in LLMs is theoretically impossible without expert-labeled feedback.
method Investigated hallucination detection using a theoretical framework inspired by language identification.
result Automated hallucination detection is impossible for most language collections without expert-labeled feedback.

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 ↗

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 ↗

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 ↗