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

87174261348 · Jun 202019922001200920172026
48 results for proxy observations

Develops a method to estimate treatment effects using noisy proxies over time.

problem Estimating individualized treatment effects from noisy proxies of confounders.
method Deconfounding Temporal Autoencoder (DTA) combining autoencoder and causal regularization.
result Improves treatment effect estimates by leveraging noisy proxies and learning hidden confounders.

ML models predict water table depth more accurately than PB models, especially in data-scarce regions.

problem Uncertainty in large-scale simulations of water table depth due to biased observational data and model flexibility.
method Constructed three ML models using XGBoost and over 20 million real and proxy observations across the US and Canada.
result ML models correlate 0.6-0.75 with real and proxy observations, significantly better than PB models (0.21-0.40).

Single proxy variable helps estimate causal effects from confounders.

problem Estimating causal effects from treatment to outcome when unobserved confounders are present.
method Assumes a single, potentially multi-dimensional proxy variable of the unobserved confounder and a known mechanism generating the proxy from the confounder. Proves causal effects are identifiable under completeness assumption.
result Causal effects are identifiable under SPICE assumption.

SAGE generates subsurface velocity models from sparse well logs and seismic images.

problem Lack of high-quality subsurface velocity models due to limited data availability.
method Subsurface AI-driven geostatistical extraction using proxy posterior.
result SAGE produces geologically plausible and statistically accurate velocity realizations.

Kernel methods estimate causal effects with a single proxy for deterministic confounders.

problem Estimating causal effects with a single proxy for an unobserved confounder.
method Two kernel-based methods: two-stage regression and maximum moment restriction.
result Both kernel methods can consistently estimate the causal effect.

Study identifies conditions for proxy adjustment in confounded binary treatment outcomes.

problem Average causal effect estimation with a non-differentially mismeasured binary confounder.
method Identifies conditions for proxy adjustment in the presence of a non-differentially mismeasured binary confounder.
result Adjusting for a non-differentially mismeasured binary proxy can improve estimation of the average causal effect.

Reducing volatility proxy improves apparent market correlation dynamics.

problem Attributing apparent slow collective market dynamics to intrinsic or driver inheritance.
method Coupled Ornstein-Uhlenbeck model with VIX proxy, decomposing and controlling for autocorrelation.
result VIX-coupled model reduces effective relaxation time from 298 to 61 trading days, improving fit over bare mean reversion.

Bayesian method estimates causal effects with proxy networks.

problem Estimating causal effects with only proxy measurements of a latent interference network.
method Structural causal model with Block Gibbs sampler and Locally Informed Proposals.
result Accurately estimates causal effects even with noisy proxy networks.

New method combines strengths of two PCL approaches without density ratio estimation.

problem Estimating causal functions in Proxy Causal Learning with unobserved confounders and proxies.
method Kernel-based doubly robust estimators combining treatment and outcome bridges, density ratio-free.
result Outperforms existing methods on PCL benchmarks, including a prior doubly robust method.

PROBE optimizes best-arm identification with cheap proxies, improving sample complexity.

problem Fixed-confidence best-arm identification with costly rewards and correlated cheap proxies.
method PROBE uses control-variate adjustment and phase elimination to learn residual variance online.
result PROBE achieves oracle sample complexity up to a constant factor and additive calibration cost.

As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, ha…

2012-06-27abs ↗pdf ↗

In distributed reinforcement learning, it is common to exchange the experience memory of each agent and thereby collectively train their local models. The experience memory, however, contains all the preceding state observations and their corresponding policies of the host agent, which may violate the privacy of the ag…

2019-07-15abs ↗pdf ↗

VTD uses deep embeddings to estimate treatment effects from longitudinal data without unconfoundedness assumption.

problem Challenges in estimating individualized treatment effects from longitudinal observational data due to confounding bias.
method Leverages deep variational embeddings and observed proxies to learn hidden confounders.
result Effective in estimating treatment effects when hidden confounding is the leading bias.

Learning individual-level causal effects from observational data, such as inferring the most effective medication for a specific patient, is a problem of growing importance for policy makers. The most important aspect of inferring causal effects from observational data is the handling of confounders, factors that affec…

2017-05-24abs ↗pdf ↗

New approach predicts under latent shifts using high-dimensional images.

problem Prediction under latent subgroup shifts with high-dimensional observations.
method Recognition-parametrised model (RPM) for identifying causal latent structure.
result Successfully adapts predictions for high-dimensional image data.

The paper predicts an Efficient Market Property for the equity market, where stocks, when denominated in units of the growth optimal portfolio (GP), have zero instantaneous expected returns. Well-diversified equity portfolios are shown to approximate the GP, which explains the well-observed good performance of equally …

2017-06-21abs ↗pdf ↗

Discovering causal relations is fundamental to reasoning and intelligence. In particular, observational causal discovery algorithms estimate the cause-effect relation between two random entities XX and YY, given nn samples from P(X,Y)P(X,Y). In this paper, we develop a framework to estimate the cause-effect relation bet…

2017-02-23abs ↗pdf ↗

New method mitigates bias without sensitive data using causal graph and variational autoencoder.

problem Lack of fairness strategies when sensitive attributes are not collected.
method SRCVAE framework based on causal graph for inferring a proxy sensitive attribute.
result Significant improvements in fairness metrics over existing methods.

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.

Bayesian method mitigates negative transfer in unknown source data.

problem Negative transfer in transfer learning where target performance worsens after source data consideration.
method Proxy-informed robust method for probabilistic transfer learning (PROMPT).
result Negative transfer can be mitigated without prior knowledge of source data.

Study accelerates NAS research with a large dataset of ZC proxies.

problem Speeding up neural architecture search with ZC proxies.
method Created NAS-Bench-Suite, evaluated 13 ZC proxies across 28 tasks, and provided a unified codebase.
result ZC proxies capture substantial complementary information and can improve NAS algorithm performance.

Unified framework for analyzing neural networks trained by gradient descent.

problem Lack of generalizable guarantees for neural networks trained by gradient descent.
method Proxy convexity and proxy Polyak-Lojasiewicz inequalities.
result Unified guarantees for neural networks trained by gradient descent.

Combining experimental and observational data for long-term causal effects.

problem Estimating causal effects of treatment on long-term outcomes using mixed data types.
method Three approaches for fusing experimental and observational data: equal confounding, shared confounder, and proxy variables.
result Developed estimators for each approach and analyzed their robustness.

Unified framework for inference in complex nonlinear processes.

problem Challenges in inferring nonlinear continuous stochastic processes with sparse observations and complex topologies.
method Neural Backward Filtering Forward Guiding (NBFFG) framework that constructs a variational posterior using a proxy linear-Gaussian process.
result Empirical results show NBFFG outperforms baselines on synthetic benchmarks and high-dimensional phylogenetic analysis tasks.

Robust reinforcement learning agents generalize well to out-of-distribution settings using pretrained representations.

problem Achieving sample-efficient reinforcement learning agents that generalize to real-world settings.
method Trained 240 representations and 10,000 RL policies on a simulated robotic setup, evaluating different pretrained VAE-based representations' effects on OOD generalization.
result Many reinforcement learning agents are surprisingly robust to realistic distribution shifts, including sim-to-real cases.

Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.

problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.

When society maintains a competitive system to promote an abstract goal, competition by necessity relies on imperfect proxy measures. For instance profit is used to measure value to consumers, patient volumes to measure hospital performance, or the Journal Impact Factor to measure scientific value. Here we note that \t…

2018-03-01abs ↗pdf ↗

DFPV improves PCL for confounded bandit policy evaluation.

problem Estimating causal effects in confounded settings with high-dimensional data.
method Deep feature proxy variable method (DFPV) for high-dimensional, nonlinear relationships.
result DFPV outperforms state-of-the-art methods on synthetic benchmarks and confounded bandit problems.