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

Trend · papers per month

119239358477 · Jun 202019922001200920172026
48 results for processed outcomes

Paper resolves the debate on process vs. outcome supervision in reinforcement learning.

problem Distinguishing between process and outcome supervision in reinforcement learning.
method Developed a technical tool (Change of Trajectory Measure Lemma) to show equivalence between outcome and process supervision under standard data coverage assumptions.
result Reinforcement learning through outcome supervision is statistically equivalent to process supervision, up to polynomial factors in horizon.

Proposes a framework for causal inference with processed outcomes in biomedical research.

problem Impact of intra-subject processing on inter-subject statistical inference in biomedical research.
method Semiparametric framework with multiply robust estimators and step-down procedure for high-dimensional inference.
result Superior performance of the proposed approach demonstrated through simulations and application to autism research.

Study assesses weakly-supervised methods for rare outcomes in medical records.

problem Identifying patients with specific medical conditions using electronic health records.
method Compared three methods (PheNorm, MAP, and sureLDA) in simulations with varying outcomes and silver labels.
result No single method consistently outperformed others, but sureLDA often did well.

CCN estimates full potential outcome distributions without restrictive assumptions.

problem Estimating CATE is insufficient; full potential outcome distributions provide greater insights.
method Collaborating Causal Networks (CCN) learns full potential outcome distributions without restrictive assumptions.
result CCN learns distributions that asymptotically capture true potential outcome distributions.

DynForest R package predicts outcomes with time-dependent predictors.

problem Handling time-dependent predictors in random forest models.
method Random forests with time-dependent predictors summarized using flexible linear mixed models.
result DynForest can predict continuous, categorical, and survival outcomes.

Study uses remotely sensed data to infer economic outcomes in experiments and quasi-experiments.

problem Imperfect measurement of economic outcomes by remotely sensed variables.
method Combines experimental and observational data to identify causal parameters, using satellite imagery and mobile phone activity.
result Developed a robust method for n^{-1/2} inference that does not restrict remotely sensed variable processing algorithms.

A new meta-learner improves prediction of individualized outcomes in sequential decisions.

problem Predicting individualized outcomes over long horizons in sequential decision-making.
method Developed a novel meta-learner called DRQ-learner with theoretical guarantees of orthogonality and quasi-oracle efficiency.
result DRQ-learner achieves quasi-oracle efficiency, doubly robustness, and Neyman-orthogonality.

Gaussian Processes offer a flexible method for modeling and predicting outcomes with uncertainty estimates.

problem Capturing uncertainty in predictions at new data points, especially with poor overlap and extrapolation.
method Gaussian Processes model a posterior distribution over outcomes, reflecting the range of plausible models.
result GPs provide a principled approach to handling extrapolation and uncertainty in predictions.

A new method removes biases in data integration by using surrogate control outcomes.

problem Data integration methods can be biased due to data-dependent processes.
method Post-integrated inference method using surrogate control outcomes to account for latent heterogeneity.
result The method provides consistent and efficient estimators under minimal assumptions and potential misspecifications.

This study simulates biases in classifiers to assess fairness.

problem Mitigating biases in predictive models to ensure fairness.
method Agent-based model (ABM) to generate synthetic datasets with controlled biases, applied to offline and online learning approaches.
result Demonstrates how biases in data affect classifier outcomes and how mitigations impact feature usage.

Trajectory-level supervision allows efficient offline reinforcement learning.

problem Offline reinforcement learning
method Developing a statistical theory for offline policy optimization from trajectory-level labels
result Proving a high-probability guarantee of order O~(H2Csa(π)/n)\widetilde O(H^2\sqrt{C_{sa}(\pi^\star)/n})

A Bayesian agent learns about the structure of a stationary process from ob- serving past outcomes. We prove that his predictions about the near future become ap- proximately those he would have made if he knew the long run empirical frequencies of the process.

2014-06-25abs ↗pdf ↗

BEACON optimizes discovery by efficiently finding novel behaviors.

problem Discovering diverse system behaviors without a scalar objective.
method Bayesian optimization inspired strategy using multi-output Gaussian processes.
result BEACON discovers broader sets of distinct behaviors than competing methods.

A new method learns outcome-aware spectral features for causal effect estimation.

problem Estimation of causal effects in the presence of hidden confounders.
method Augmented Spectral Feature Learning framework that minimizes a contrastive loss derived from an augmented operator incorporating outcome information.
result Our method remains effective even under spectral misalignment.

New methods interpret clustering outcomes without altering data structure.

problem Post-processing methods destroy data integrity and obscure interpretations.
method Algorithm-agnostic interpretation methods using permutation feature importance, individual conditional expectation, and partial dependence.
result Preserves original feature structure and explains clustering outcomes.

Paper tackles non-monotonic resource utilization in sequential decision-making.

problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.

Proposes a test to ensure predictive algorithms predict intended outcomes better than unintended ones.

problem Unintended model behavior leading to prediction of unintended outcomes.
method Falsification framework using nonparametric hypothesis testing to compare prediction losses across outcomes.
result Establishes discriminant validity with respect to gender but not race in an admissions setting.

This study evaluates subgroup analysis methods for time-to-event outcomes in randomized controlled trials.

problem Identifying subgroups of good responders in non-significant randomized controlled trials.
method Evaluation of several subgroup analysis algorithms for time-to-event outcomes using synthetic and semi-synthetic data.
result Provides a new synthetic and semi-synthetic data generation process and an open-source Python package for benchmarking.

A new method models continuous-time counterfactual outcomes using neural controlled differential equations.

problem Estimating personalized healthcare outcomes over irregularly sampled data.
method Interpreting data as samples from a continuous-time process, modeling latent trajectory using controlled differential equations, and using adversarial training for time-dependent confounding.
result TE-CDE consistently outperforms existing approaches in irregularly sampled scenarios.

Optimizes treatment duration to maximize quality-adjusted lifetime.

problem Balancing risks and benefits in clinical decision making.
method Proposes a weighted estimating equation to adjust for confounding and informative censoring, and a nonparametric estimator for mean counterfactual quality-adjusted lifetime.
result Shows the optimal time for percutaneous endoscopic gastrostomy insertion in ALS patients.

Paper uses Gaussian processes to handle shared latent confounders in causal inference.

problem Bias in causal effect estimates due to shared latent confounders.
method Hierarchical Bayesian model, Gaussian processes with structured latent confounders (GP-SLC), Monte Carlo inference algorithm.
result GP-SLC provides accurate estimates of individual treatment effects with minimal assumptions.

Algorithm optimizes bandit decisions with changing action sets using Gaussian processes.

problem Optimizing decisions in a bandit problem with time-varying action sets.
method Proposes an algorithm called O'CLOK-UCB using Gaussian processes to handle changing action sets and contexts.
result Achieves regret bound of ildeO(λ(K)KTγKT(tTXt)) ilde{O}(\sqrt{λ^*(K)KTγ_{KT}(\cup_{t\leq T}\mathcal{X}_t)} ) with high probability.

Infinite hierarchical contrastive clustering identifies personal environments linked to health outcomes.

problem Identifying meaningful relationships between environmental features and health outcomes on an individual level.
method Contrastive clustering framework with stick-breaking prior and participant-specific prediction loss.
result Model effectively identifies distinct personal environments and groups them into meaningful types linked to health outcomes.

Inspired by applications in sports where the skill of players or teams competing against each other varies over time, we propose a probabilistic model of pairwise-comparison outcomes that can capture a wide range of time dynamics. We achieve this by replacing the static parameters of a class of popular pairwise-compari…

2019-03-18abs ↗pdf ↗

The paper proposes a method to ensure fairness in machine learning models.

problem Ensuring fairness in machine learning models powered by supervised learning.
method Optimal affine transport and Wasserstein-2 barycenter to characterize the Pareto frontier between prediction error and statistical disparity.
result The proposed method effectively balances prediction accuracy and fairness, as demonstrated by numerical simulations.

Robust Bayesian inference improves model performance on discrete data.

problem Misspecification of discrete-valued models leads to poor inference and prediction.
method Total Variation Distance (TVD) for discrepancy, efficient estimator and inference method.
result Our approach significantly improves predictive performance on various data.

We briefly review the approach to optimization of portfolios according to the theory of Markowitz and propose a further modification that can improve the outcome of the optimization process. The modification takes account of the entropic contribution from the time series used to compute the parameters in the Markowitz …

2014-08-01abs ↗pdf ↗

Extends expected value framework for cost-sensitive causal decision-making.

problem Optimizing operational decision-making with cost-sensitive causal classification.
method Introduces a cost-sensitive decision boundary based on estimated individual treatment effects, positive outcome probability, and cost parameters.
result Effective in maximizing expected causal profit, outperforming cost-insensitive ranking approach.

Optimal linear contracts are possible even with memory in Gaussian settings.

problem Can optimal dynamic contracts be linear when agents control memory processes?
method Developed a methodology for non-Markovian and non-semimartingale settings, showed linear contracts are optimal for one-dimensional models.
result Linear contracts are optimal for one-dimensional models with memory, and for radial effort cost functions in higher dimensions.