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

172343515686 · Jun 202019922001200920172026
48 results for imperfect demonstrations

Paper improves RL from imperfect demonstrations with soft expert guidance.

problem Improper and insufficient expert demonstrations in RLfD.
method Formalizes imperfect expert setting, tackles optimality and convergence issues with soft constraints, and uses local linear search on dual form.
result Method achieves consistent improvement over other RLfD 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.

Paper proposes a pretraining method for soft Q-learning from imperfect demonstrations.

problem Challenges in exploiting expert demonstrations while maintaining exploration potentials.
method γ-discounted biased policy evaluation with entropy regularization.
result Our method effectively learns from imperfect demonstrations and outperforms other methods.

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.

Estimates treatment effects in randomized experiments with non-compliance.

problem Estimating distributional treatment effects in experiments with imperfect compliance.
method Proposes a regression-adjusted estimator based on distribution regression with Neyman-orthogonal moment conditions.
result Achieves semiparametric efficiency bound and demonstrates favorable performance in simulations and real data.

Bayesian framework calibrates imperfect models using physics-informed priors and Hamiltonian Monte Carlo.

problem Quantifying uncertainty in imperfect computer models described by differential equations.
method Physics-informed Gaussian process priors, discrepancy function, Hamiltonian Monte Carlo, data approximations.
result Framework accurately recovers true parameters and produces accurate predictions.

The paper explores how regularization can lead to convergence in imperfect information games.

problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.

Model learns tensor representations from imperfect multimodal data.

problem Learning from imperfect multimodal data with noise or missing entries.
method Tensor rank minimization to regularize rank of tensor representations.
result Model effectively learns tensor representations from imperfect data.

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.

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 ↗

Paper introduces a method to learn physics between digital twins using imperfect models.

problem Learning physics from imperfect data and low-fidelity models.
method Bayesian Hierarchical modeling with physics-informed Gaussian processes.
result Models learning between digital twins are less uncertain than independent models but not over-confident.

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.

The paper proposes a new framework to generate synthetic data with human-like imperfections to prevent model collapse.

problem Model collapse due to statistical optimization of synthetic data.
method Introduces Prompt-driven Cognitive Computing Framework (PMCSF) with Cognitive State Decoder (CSD) and Cognitive Text Encoder (CTE).
result The framework generates text with cognitive imperfections, reducing maximum drawdown and delivering defensive alpha.

Bayesian machine learning algorithm for causal effects with imperfect compliance.

problem Heterogeneous causal effects in imperfect compliance scenarios.
method Bayesian Causal Forest with Instrumental Variable (BCF-IV) methodology.
result BCF-IV outperforms other techniques in discovering and estimating heterogeneous causal effects.

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.

We investigate LIBOR-based derivatives using a parsimonious field theory interest rate model capable of instilling imperfect correlation between different maturities. Delta and Gamma hedge parameters are derived for LIBOR Caps against fluctuations in underlying forward rates. An empirical illustration of our methodolog…

2005-04-29abs ↗pdf ↗

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 ↗

New algorithms reduce regret in online learning with imperfect hints.

problem Designing algorithms to minimize regret in online learning with imperfect hints.
method Developed algorithms that are resilient to bad hints and interpolate between correlated and no-hints cases.
result Achieved nearly matching lower bounds for online learning with imperfect directional hints.

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.

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.

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.

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.

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.

Safe autonomous decisions made with machine learning predictions using Conformal Decision Theory.

problem Safe decisions from imperfect machine learning predictions.
method Conformal Decision Theory framework for producing safe decisions.
result Safe decisions with provable statistical guarantees of low risk.

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.

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.

The paper explores how a geometric flow can turn a black hole into a traversable wormhole.

problem The study investigates how a static, spherically symmetric black hole can be transformed into a traversable wormhole.
method The approach involves analyzing almost ηη-Ricci-Yamabe solitons and their geometric coupling with the Hawking temperature.
result The geometric flow successfully transforms the black hole into a traversable wormhole, opening the throat and preserving the exact cosmological spacetime.

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.

We present a novel methodology for predicting future outcomes that uses small numbers of individuals participating in an imperfect information market. By determining their risk attitudes and performing a nonlinear aggregation of their predictions, we are able to assess the probability of the future outcome of an uncert…

2001-08-02abs ↗pdf ↗

The paper proposes a fast method to predict tactical solutions to operational problems under imperfect information.

problem Predicting tactical solutions to operational planning problems under imperfect information.
method Formulated as a two-stage optimal prediction stochastic program, solved with a supervised machine learning algorithm using training data from deterministic problems.
result Deep learning algorithms produce highly accurate predictions in very short computing time (milliseconds or less).