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

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for proxy covariates

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.

Forecast reconciliation improves portfolio risk forecasts, especially when true covariance is known.

problem Improving portfolio risk forecasts using multivariate GARCH models.
method Combining univariate and multivariate forecasts with forecast reconciliation techniques.
result Forecast reconciliation improves over standard multivariate approaches, especially when true covariance is known.

Proposes a method to correct for covariate shift in meta-analysis of randomized trials.

problem Invalidation of standard IPD meta-analysis due to covariate shift across studies.
method Placebo-anchored transport framework that treats source-trial outcomes as proxy signals and target-trial placebo outcomes as gold labels.
result Yields target-identified effect estimates in connected targets and a principled screen--then--transport procedure in disconnected targets.

GATs improve node regression on noisy graphs with provable advantage.

problem Improving node regression on graphs with noisy covariates and edges.
method Proposes a GAT designed for denoising proxy features in node regression.
result GAT achieves lower error in estimating regression coefficient and predicting responses.

Estimates disease prevalence using non-ignorable missing data in health surveys.

problem Estimating disease prevalence in non-representative samples with non-ignorable missing data.
method Connects auxiliary proxy variable framework to label shift setting, uses high-dimensional covariates without generative models.
result Fails to account for non-ignorable missingness can lead to significant misestimations.

This paper presents new algorithms to solve the feature-sparsity constrained PCA problem (FSPCA), which performs feature selection and PCA simultaneously. Existing optimization methods for FSPCA require data distribution assumptions and are lack of global convergence guarantee. Though the general FSPCA problem is NP-ha…

2019-04-23abs ↗pdf ↗

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 neural networks improve cancer dynamics prediction.

problem Predicting cancer dynamics under treatment due to heterogeneity and sparse data.
method Hierarchical Bayesian model using baseline covariates and Bayesian neural networks for nonlinear interactions.
result Bayesian neural networks outperform linear models in predicting cancer dynamics with interactions.

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.

Neural network models improve ROC curve evaluation of biomarkers, focusing on age's role in physical activity-mortality association.

problem Improving biomarker evaluation using machine learning for complex relationships.
method Proposes neural network-based covariate-adjusted ROC modeling.
result Age has distinct effects on mortality outcomes when physical activity is measured as total activity time.

MediEncoder learns nonlinear representations for causal mediation analysis.

problem High-dimensional noisy covariates and mediators in biomedical studies.
method Coupled encoder-decoder architecture with cross-factor network.
result Improves estimation accuracy in high-dimensional causal mediation analysis.

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.

A framework uses proxies to prioritize treatment without estimating causal effects.

problem Prioritizing treatment when causal effects are hard to estimate.
method Decision-focused framework identifying conditions for proxy usefulness.
result Proxies can recover correct effect ordering under specific conditions.

The paper develops methods to reduce deployment risk under dynamic covariate shifts.

problem Reduction of deployment risk under dynamic covariate shifts.
method Time-domain Poincare inequality and Jacobian-velocity theorem to identify and control directional tangent energy.
result Drift-aligned tangent regularization (DTR) reduces risk volatility and directional gain in low-rank drift regimes.

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.

A scalable method for deep metric learning using chance constraints.

problem Improving deep metric learning by addressing feasibility issues.
method Relating DML to chance constraints, reformulating as a feasibility problem, and iteratively training proxies.
result The method effectively improves deep metric learning performance across multiple benchmarks.

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.

A machine learning model may exhibit discrimination when used to make decisions involving people. One potential cause for such outcomes is that the model uses a statistical proxy for a protected demographic attribute. In this paper we formulate a definition of proxy use for the setting of linear regression and present …

2018-10-16abs ↗pdf ↗

New analysis of Muon and SignSGD on matrix-valued least squares problems.

problem Understanding the behavior of Muon and SignSGD on matrix-valued least squares problems.
method Derive explicit deterministic dynamics to study learning behavior of Muon and SignSGD.
result Muon and SignSGD exhibit different optimal learning rates and convergence characteristics based on batch size and data covariance.

New conditions show proxy data can improve policy learning in sparse expert data contexts.

problem Improving sample complexity of policy learning with sparse expert data.
method Sufficient conditions for proxy data to improve sample complexity, adaptable to LLMs.
result Provable improvement in sample complexity for policy learning with proxy data.

New Transformer architecture prevents rank degeneracy in deep attention models.

problem Rank degeneracy in deep attention models.
method Modified Softmax-based attention model with skip connections, centered at identity, and scaled logits.
result Existence of a stable SDE implies well-behaved covariance structure, preventing rank degeneracy.

A new probabilistic approach improves deep metric learning by considering image uncertainties and class-specific variances.

problem Proxy-based deep metric learning struggles with image uncertainties and class-specific structures.
method Introduces non-isotropic probabilistic proxy-based deep metric learning using directional von Mises-Fisher distributions.
result Improves generalization performance and competitive on standard benchmarks.

SGD improves generalization by using gradient variability as a proxy for data randomness.

problem Improving generalization in machine learning models trained with stochastic gradient descent.
method Bootstrap perspective on SGD, analyzing gradient variability and algorithmic variability.
result SGD avoids spurious solutions and improves generalization by implicitly regularizing the trace of the gradient covariance matrix.

Monotonic relationship found between in-distribution and out-of-distribution performance.

problem Understanding performance of machine learning models under distribution shifts.
method Analyzing ridge-regularized models and linear inverse problems under covariate shift.
result Monotonic relationship between in-distribution and out-of-distribution performance for certain models.

Proposes a method to create robust linear models with noisy proxies of unobserved variables.

problem Learning robust linear models to handle interventions on unobserved variables with noisy proxies.
method Regularization term that balances in-distribution performance and robustness to interventions.
result Single proxy can create prediction optimal estimators under interventions of bounded strength.

One of the biggest bottlenecks in a machine learning workflow is waiting for models to train. Depending on the available computing resources, it can take days to weeks to train a neural network on a large dataset with many classes such as ImageNet. For researchers experimenting with new algorithmic approaches, this is …

2019-06-12abs ↗pdf ↗

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.

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.

A new geometric framework resolves singularities in anomalous transport.

problem Mathematical singularities in quantum Berry connections.
method Hodge-de Rham decomposition of the Brillouin zone.
result A smooth geometric proxy potential for anomalous transport.