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.
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.
Research suggests using deep learning for better recommendation systems.
problem Recommender systems rely on proxies for A/B testing, leading to random success.
method Advocates for using deep learning to improve recommendation performance.
result Deep learning can potentially optimize reward in recommendation systems.
Regulators require financial institutions to estimate counterparty default risks from liquid CDS quotes for the valuation and risk management of OTC derivatives. However, the vast majority of counterparties do not have liquid CDS quotes and need proxy CDS rates. Existing methods cannot account for counterparty-specific…
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.
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 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.
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.
New method handles many noisy proxy controls for causal inference.
problem Causal inference with many noisy proxy controls and unknown confounders.
method Linear models with rank-restricted and sparse nuisance parameters, penalization methods.
result Estimators achieve better performance in high dimensions, especially with many proxies.
A new method normalizes activations to match batch normalization without batch dependence.
problem Performance degradation with batch-independent normalization techniques.
method Proxy-Normalizing Activations
result Proxy-Normalization technique emulates batch normalization's behavior and performance.
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.
Granger causality analysis, as one of the most popular time series causality methods, has been widely used in the economics, neuroscience. However, unobserved confounders is a fundamental problem in the observational studies, which is still not solved for the non-linear Granger causality. The application works often de…
New framework for choosing optimal proxy metrics from past experiments.
problem Difficult to measure long-term treatment effects in experiments.
method Statistical framework to define and construct optimal proxy metrics.
result Optimal proxy metric depends on experiment's sample size.
New concept: reward hacking, where optimizing a flawed reward function can hurt performance.
problem Optimizing imperfect reward functions leads to poor performance.
method Formal definition and analysis of reward hacking, examining conditions for unhackability.
result Reward functions are usually hackable, making it hard to align AI with human values.
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.
Detects harmful shifts without labels for model performance.
problem Detecting distribution shifts without access to labels.
method Uses a proxy derived from predictions of an error estimator.
result High power and false alarm control under various shifts.
Algorithm identifies best arm with biased proxy and selective ground truth audits.
problem Fixed-confidence best-arm identification with biased proxy and selective ground truth.
method Propensity-weighted estimator and adaptive auditing algorithm.
result Plug-in Neyman rule achieves near-oracle audit efficiency.
Method for creating synthetic multi-fidelity data sets.
problem Lack of representative synthetic datasets for multifidelity optimisation benchmarks.
method Systematic generation of synthetic fidelities from preexisting datasets.
result Allows systematic investigation of lower fidelity proxies' influence.
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.
Data selection methods, such as active learning and core-set selection, are useful tools for machine learning on large datasets. However, they can be prohibitively expensive to apply in deep learning because they depend on feature representations that need to be learned. In this work, we show that we can greatly improv…
Modern computer vision algorithms typically require expensive data acquisition and accurate manual labeling. In this work, we instead leverage the recent progress in computer graphics to generate fully labeled, dynamic, and photo-realistic proxy virtual worlds. We propose an efficient real-to-virtual world cloning meth…
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.
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.
New method recovers latent confounders from high-dimensional proxy variables.
problem Detecting latent confounders from high-dimensional proxy variables.
method Proxy Confounder Factorization (PCF) framework using ICA-PCF and GD-PCF.
result ICA-PCF recovers confounders with high correlation and low error in synthetic and real-world data.
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.
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…
Predicting delayed outcomes is an important problem in recommender systems (e.g., if customers will finish reading an ebook). We formalize the problem as an adversarial, delayed online learning problem and consider how a proxy for the delayed outcome (e.g., if customers read a third of the book in 24 hours) can help mi…
ProxySHAP approximates Shapley and Banzhaf interactions efficiently.
problem Efficient estimation of complex machine learning interactions.
method ProxySHAP combines tree-based proxy models with residual correction.
result ProxySHAP achieves state-of-the-art interaction approximation quality.
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 …
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.
Improved 3D MRI classification using contrastive learning with continuous proxy metadata.
problem Insufficient labelled data for 3D medical image classification.
method Proposed a new loss function (y-Aware InfoNCE) to leverage continuous proxy metadata in contrastive learning.
result 3D CNN model pre-trained on 10^4 multi-site healthy brain MRI scans outperforms fully-supervised methods.
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.
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 …
The study examines fairness metrics in noisy covariate settings, providing theoretical guarantees.
problem Fairness measurement under noisy covariate information.
method Theoretical analysis of group fairness metrics using proxies for covariates.
result Characterization of weaker conditions for accurate fairness evaluation.
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.
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.
Estimates proxy-based inference adjustments for distribution shifts.
problem Imperfect proxy data leads to biased inference.
method Empirical calibration of proxy-primary metric discrepancy as a random effect.
result Empowers inference without individual-level response data.
Study shows how adjusting for a binary proxy can bound causal effects.
problem Bounding causal effects with a binary confounder and proxy.
method Monotonicity assumption applied to a binary confounder and observed proxy.
result Adjusting for a proxy produces a measure of the effect between unadjusted and true measures.
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 …
Cluster stability selection improves feature selection in correlated data.
problem Feature selection stability in correlated data.
method Cluster stability selection exploiting known cluster structure.
result Better predictive performance than lasso alone and stability selection.
Estimates model performance under distribution shift using domain-invariant predictors.
problem Poor performance of models on test distributions different from training distributions.
method Uses domain-invariant predictors as a proxy for unknown target labels.
result Shows that the complexity of latent representations influences target risk.
New methods identify causal effects without needing complete proxy variables.
problem Identifying causal effects in the presence of unmeasured confounders.
method Partial identification methods that do not require completeness of proxy variables.
result Obtain bounds on causal effects using available proxy variables.
Estimates causal effect using proxies in multi-domain settings.
problem Estimating causal effect in settings with unobserved confounders across domains.
method Proposes estimation techniques using proxy variables for discrete or categorical data.
result Proves identifiability and consistency of causal effect estimation.
Q-NETs use neural networks to estimate integrals of low-dimensional functions efficiently.
problem Estimating integrals of multidimensional functions with costly evaluations.
method Fixed neural networks (Q-NETs) that operate on proxy function parameters to calculate exact integrals over subsets of dimensions.
result Q-NETs can calculate integrals over any subset of dimensions without resampling or retraining the proxy.
Due to the recent advances on Neural Architecture Search (NAS), it gains popularity in designing best networks for specific tasks. Although it shows promising results on many benchmarks and competitions, NAS still suffers from its demanding computation cost for searching high dimensional architectural design space, and…
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.
Two proxy methods for causal identification are compared.
problem Identifying causal effects in the presence of unmeasured variables.
method Bridge equation methods vs. array decomposition methods.
result Model restrictions and implications of assumptions differ between methods.
New method identifies latent treatment effects from proxy models.
problem Identifying heterogeneous treatment effects under unobserved confounding.
method Compressed observable operator and spectral analysis of treatment effects.
result Eigenvalues of the operator represent latent treatment effects.