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,695 papers · 148 categories

Trend · papers per month

3877741,1601,547 · Jun 202019922001200920172026
48 results for Incorrect Learning

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.

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.

In reinforcement learning, we can learn a model of future observations and rewards, and use it to plan the agent's next actions. However, jointly modeling future observations can be computationally expensive or even intractable if the observations are high-dimensional (e.g. images). For this reason, previous works have…

2020-02-07abs ↗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.

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.

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.

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.

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…

2015-10-09abs ↗pdf ↗

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 nn agents (users) {xi}i[n]\{x_i\}_{i \in [n]} and mm alternatives (items) {yj}j[m]\{y_j\}_{j \in [m]}, each of which is associated with a latent feat…

2018-07-09abs ↗pdf ↗

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.

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.

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 …

2019-11-25abs ↗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.

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…

2019-02-20abs ↗pdf ↗

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.

This paper introduces and evaluates a novel training method for neural networks: Dual Variable Learning Rates (DVLR). Building on insights from behavioral psychology, the dual learning rates are used to emphasize correct and incorrect responses differently, thereby making the feedback to the network more specific. Furt…

2020-02-09abs ↗pdf ↗

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.

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…

2016-10-30abs ↗pdf ↗

Study shows resampling labels improves classifier performance in noisy data.

problem Balancing sample size vs label reliability in noisy data.
method Comparing different validation strategies and analyzing MNIST database with varying noise levels.
result Classifier performance declines with high incorrect labels, highlighting the importance of resampling.

Deep neural networks are vulnerable to adversarial examples - small input perturbations that result in incorrect predictions. We study this problem for models of source code, where we want the network to be robust to source-code modifications that preserve code functionality. (1) We define a powerful adversary that can…

2020-02-07abs ↗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. 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 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 ↗

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 ↗