New method tackles simulator imperfection in data assimilation.
problem Handling simulator imperfection in data assimilation.
method Ensemble-based kernel learning approach.
result Functional approximation through machine learning can handle simulator imperfection.
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.
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…
Method maps imperfect simulations to observed stellar spectra using unsupervised domain adaptation.
problem Mapping from large sets of imperfect simulations and observational data.
method Adversarial autoencoders, cycle-consistency constraint, and generative surrogate physics emulator network.
result Reconstructed spectra quality and discovery of new spectral features.
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 / T 1/\sqrt{T} 1/ T convergence rate. result IXOMD achieves 1 / T 1/\sqrt{T} 1/ T convergence rate to NE. 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 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.
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.
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.
Develops methods to improve demand counterfactuals from imperfect proxies.
problem Imperfect proxies in demand models lead to biased counterfactuals and invalid inference.
method Practical toolkit for market-level and individual data, requiring minimal computation.
result Improves substitution prediction and counterfactual performance.
New method improves IL from imperfect demos using confidence scores.
problem Learning optimal policies from imperfect demonstrations is challenging.
method Proposes two confidence-based IL methods: 2IWIL and IC-GAIL.
result Confidence scores from sub-optimal demos significantly improve IL performance.
We introduce a new virtual environment for simulating a card game known as "Big 2". This is a four-player game of imperfect information with a relatively complicated action space (being allowed to play 1,2,3,4 or 5 card combinations from an initial starting hand of 13 cards). As such it poses a challenge for many curre…
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.
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.
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.
Method corrects bias in regression using simulated data and real-world gene expression data.
problem Bias in estimated effect parameters due to misclassification of class labels.
method Simulation and extrapolation method to correct bias.
result Corrected bias in estimated effect parameters.
We propose a new non parametric technique to estimate the CALL function based on the superhedging principle. Our approach does not require absence of arbitrage and easily accommodates bid/ask spreads and other market imperfections. We prove some optimal statistical properties of our estimates. As an application we firs…
Mobile network that millions of people use every day is one of the most complex systems in the world. Optimization of mobile network to meet exploding customer demand and reduce capital/operation expenditures poses great challenges. Despite recent progress, application of deep reinforcement learning (DRL) to complex re…
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.
New method robustly discovers causal relationships from imperfect data.
problem Challenges in causal discovery from imperfect structural constraints.
method Prior alignment and conflict resolution through surrogate model and multi-task learning.
result Proposes a robust method for causal discovery under imperfect constraints.
Volatility smiles emerge from imperfect hedging in financial markets.
problem Imperfect hedging in financial markets leads to volatility smiles.
method Examined option prices as fair game agreements based on expected payoffs and risk.
result Resulting prices lead to the volatility smile.
Study on teaching with imperfect knowledge, showing its impact on optimal teaching sets.
problem Effect of imperfect teacher knowledge on effective teaching.
method Connections to machine teaching problem, optimal teaching sets.
result Teacher's success or failure depends on imperfect knowledge.
Spiking neuronal networks are usually simulated with three main simulation schemes: the classical time-driven and event-driven schemes, and the more recent hybrid scheme. All three schemes evolve the state of a neuron through a series of checkpoints: equally spaced in the first scheme and determined neuron-wise by spik…
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.
New numerical method for quantile hedging in imperfect markets.
problem Quantile hedging in non-linear markets with imperfections.
method Piecewise Constant Policy Timestepping (PCPT) coupled with monotone finite difference approximation.
result Convergence of the proposed numerical scheme proved using BSDE arguments.
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.
Paper studies fairness postprocessing with imperfect attribute information.
problem Ensuring fairness with imperfect protected attribute information.
method Equalized odds postprocessing method with imperfect attribute information.
result Conditions on perturbation ensure reduced bias in classifier.
Improves off-policy evaluation with imperfect annotations.
problem Limited dataset coverage for evaluating new policies.
method Doubly robust estimators combining IS and DM, incorporating counterfactual annotations.
result Using annotations within the DM component yields the most desirable theoretical results.
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.
New method predicts y distributions from imperfect data.
problem Predicting y from imperfect data (discrete, truncated, censored).
method Optimal transformations to estimate p(y|x).
result Estimates location, scale, and shape of y distribution.
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.
Study learns optimal strategies in imperfect information games with self-play.
problem Learning optimal strategies in imperfect information games.
method Proposes Follow the Regularized Leader (FTRL) algorithms for imperfect information games.
result Proposes two FTRL algorithms: Balanced FTRL and Adaptive FTRL.
CPP improves predictive model outputs for better intervention decisions.
problem Predictive models often misguide resource allocation.
method Causal post-processing techniques using limited experimental data.
result CPP can improve intervention decisions, especially with imperfect causal signals.
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…
Recently, network lasso has drawn many attentions due to its remarkable performance on simultaneous clustering and optimization. However, it usually suffers from the imperfect data (noise, missing values etc), and yields sub-optimal solutions. The reason is that it finds the similar instances according to their feature…
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.
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.
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.
Model financial network dynamics to avoid systemic risk.
problem Avoid systemic risk in financial networks.
method Model financial network as random liability graph, agents adapt strategies based on learning, analyze using ODE.
result Emerging strategies converge to evolutionary stable strategies (all risky or all less risky agents).