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

Trend · papers per month

10203040 · Jun 202019922001200920172026
48 results for imperfect annotations

New method uses imperfect LLM annotations for valid statistical inference in social science.

problem Inaccurate large language model annotations in social science research.
method Design-based supervised learning (DSL) combining imperfect LLM surrogates with gold-standard labels.
result DSL provides valid statistical inference with comparable predictive accuracy to existing methods.

The paper tackles learning from imperfect human feedback, especially in dueling bandit problems.

problem Learning from human feedback that can be irrational or imperfect.
method Developed a Robustified Stochastic Mirror Descent for Imperfect Dueling (RoSMID) algorithm.
result Achieved nearly optimal regret for dueling bandit problems under imperfect human feedback.

Investigates a Kyle model with imperfect information and risk aversion.

problem Tackles a Kyle model with imperfect information and risk-averse informed traders.
method Solves an optimal transport problem and a filtering problem under specific measures.
result Constructs an equilibrium for the Gaussian Kyle model with imperfect information and risk aversion.

Imitation learning (IL) aims to learn an optimal policy from demonstrations. However, such demonstrations are often imperfect since collecting optimal ones is costly. To effectively learn from imperfect demonstrations, we propose a novel approach that utilizes confidence scores, which describe the quality of demonstrat…

2019-01-27abs ↗pdf ↗

Corrects bias in LLM-as-a-judge evaluations using adaptive calibration.

problem Bias in LLM evaluations due to imperfect sensitivity and specificity.
method Plug-in framework with confidence intervals accounting for test and calibration dataset uncertainties.
result LML-based evaluation yields more reliable estimates than human-only evaluation.

We study the effect of imperfect training data labels on the performance of classification methods. In a general setting, where the probability that an observation in the training dataset is mislabelled may depend on both the feature vector and the true label, we bound the excess risk of an arbitrary classifier trained…

2018-05-29abs ↗pdf ↗

Policy gradient method proves convergence in imperfect-information games.

problem Policy gradient methods in imperfect-information games (EFGs).
method Policy gradient approach with best-iterate convergence.
result Policy gradient leads to provable best-iterate convergence in self-play EFGs.

JPS improves joint policies for multi-agent collaboration in imperfect information games.

problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.

Algorithm learns NE in imperfect information games with imperfect feedback.

problem Learning Nash equilibrium in imperfect information games with bandit feedback.
method IXOMD algorithm for model-free learning with 1/T1/\sqrt{T} convergence rate.
result IXOMD achieves 1/T1/\sqrt{T} convergence rate to NE.

Model financial markets using open quantum systems to understand market imperfections.

problem Understanding market imperfections through imperfect trading mechanisms.
method Using open quantum systems to represent financial markets, characterizing orbits, and analyzing reduced density matrices.
result Non-classical modes of time evolution can incorporate factors like illiquid trades and imperfect trading mechanisms.

Study shows annotation instrument design affects model performance in hate speech detection.

problem Impact of annotation instrument design on model performance in hate speech detection.
method Collected annotations from five experimental conditions of an annotation instrument, fine-tuned BERT models on each dataset, evaluated performance on holdout portion.
result Significant differences in model performance and annotations across conditions.

The study examines how verifier imperfections impact test-time scaling techniques.

problem Understanding how verifier imperfections affect test-time scaling methods.
method Proves the instance-level accuracy of Best-of-N and Rejection Sampling methods using the geometry of the verifier's ROC curve.
result RS outperforms BoN for fixed compute, but both converge to the same accuracy in the infinite-compute limit.

Researchers develop methods for causal inference with imperfect instrumental variables.

problem Quantifying cause and effect relationships with imperfect instrumental variables.
method Established a quantitative relationship between violations of instrumental inequalities and minimal measurement dependence, providing adapted inequalities valid in the presence of relaxed measurement dependence.
result Adapted inequalities for average causal effect in instrumental scenarios with binary outcomes, addressing violations of instrumental inequalities.

Paper solves learning imperfect-information games with fewer episodes.

problem Learning imperfect-information extensive-form games from bandit feedback.
method Balanced Online Mirror Descent and Balanced Counterfactual Regret Minimization algorithms.
result Achieves near-optimal sample complexity for finding approximate Nash equilibria.

We study pricing and superhedging strategies for game options in an imperfect market with default. We extend the results obtained by Kifer in \cite{Kifer} in the case of a perfect market model to the case of an imperfect market with default, when the imperfections are taken into account via the nonlinearity of the weal…

2015-11-29abs ↗pdf ↗

Active learning selects both observations and annotation precision for Gaussian Processes.

problem Costly annotation in supervised learning.
method Proposes an active learning algorithm that selects observations and annotation precision, using a modified BALD objective.
result Empirically shows the benefits of adjusting annotation precision in active learning.

One of the problems on the way to successful implementation of neural networks is the quality of annotation. For instance, different annotators can annotate images in a different way and very often their decisions do not match exactly and in extreme cases are even mutually exclusive which results in noisy annotations a…

2018-07-23abs ↗pdf ↗

Bayesian framework mixes imperfect models for improved predictions.

problem Improving predictions of complex computational models in unknown domains.
method Local Bayesian Dirichlet mixing of imperfect models using the Dirichlet distribution.
result Global and local mixtures of models achieve excellent performance in prediction accuracy and uncertainty quantification.

Selective planning with imperfect models reduces harmful effects of model inadequacy.

problem Harmful effects of using an imperfect model in reinforcement learning.
method Selective planning with heteroscedastic regression to estimate predictive uncertainty from model inadequacy.
result Effective selective planning requires considering both parameter uncertainty and model inadequacy.

Generative model combines multi-dimensional annotations for more accurate ground truth estimation.

problem Inaccurate ground truth estimation from naive annotators' multi-dimensional annotations.
method Proposes a joint multi-dimensional model for global and time-series annotation fusion using Expectation-Maximization algorithm.
result More accurate ground truth estimates through joint modeling of multiple dimensions.

RAD improves robustness to domain annotation noise without explicit domain annotations.

problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.

Survey on AL strategies for cost-effective annotation in classification.

problem Real-world AL challenges due to human annotators' limitations.
method Categorizes 60 real-world AL strategies considering multiple annotators, query types, and cost schemes.
result General real-world AL strategy introduced for categorization of 60 strategies.

Accurate annotation of medical image is the crucial step for image AI clinical application. However, annotating medical image will incur a great deal of annotation effort and expense due to its high complexity and needing experienced doctors. To alleviate annotation cost, some active learning methods are proposed. But …

2019-01-06abs ↗pdf ↗

DREAM learns optimal strategies in imperfect games without needing a simulator.

problem Learning optimal strategies in imperfect-information games with multiple agents.
method DREAM is a deep reinforcement learning algorithm that converges to Nash Equilibria and coarse correlated equilibria.
result DREAM achieves state-of-the-art performance in benchmark games and is competitive with simulator-based algorithms.

Verification helps prevent model collapse when training on synthesized data.

problem Model collapse when training on generated data.
method Theoretical characterization using Gaussian mixtures, linear classifiers, and linear verifiers to assess synthesized data quality.
result Verifiers can prevent model collapse and correlate with performance.

Study on liquidity and market efficiency in auction games with imperfect information.

problem Generating liquidity in illiquid auction markets with imperfect information.
method Characterized Nash equilibria in a two-player game with imperfect information, linking market spreads to signal strength.
result Without incentives, the market is inefficient and does not lead to trades. Quadratic fees indexed on half spread can generate liquidity.

This paper explores how imperfect reward models can improve online RLHF.

problem Sample efficiency in online RLHF from imperfect reward models.
method Identifies policy coverability and proposes TPO algorithm for transfer learning.
result TPO algorithm improves sample efficiency compared to standard online learning.

PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.

problem Inaccurate and insufficient confusion matrices for annotators in multi-class classification tasks.
method PTBCC (ProtoType learning-driven Bayesian Classifier Combination) uses prototype confusion matrices to capture annotator expertise.
result PTBCC achieves up to 15% accuracy improvement and 3% higher average accuracy compared to existing methods.

New algorithm uses imperfect advice to improve online bipartite matching performance.

problem Online bipartite matching with imperfect advice.
method Designing an algorithm that uses external advice to improve performance between advice-free methods and optimal ratio.
result Algorithm achieves competitive ratio interpolating between advice-free methods and optimal ratio of 1.

Paper proposes an efficient method for bounding box annotation in object detection.

problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.

A new framework improves VaR recalibration by balancing reliance on imperfect volatility proxies.

problem How to balance reliance on imperfect volatility proxies in one-sided VaR recalibration.
method Proxy-reliance control framework that interpolates between constant-shift and proxy-scaled corrections.
result Lower or intermediate proxy reliance can outperform fully proxy-scaled recalibration in stressed left-tail VaR control.

Combining LETKF and RC improves chaotic system prediction from noisy, sparse data.

problem Improving chaotic system prediction from imperfect observations and models.
method Combining LETKF and RC to predict spatio-temporal chaotic systems from noisy and sparsely distributed observations.
result The proposed method using LETKF and RC outperforms LETKF in predicting chaotic systems from noisy and sparse observations.