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

143286429572 · Jun 202019922001200920172026
48 results for black-box shift estimators

Faced with distribution shift between training and test set, we wish to detect and quantify the shift, and to correct our classifiers without test set labels. Motivated by medical diagnosis, where diseases (targets) cause symptoms (observations), we focus on label shift, where the label marginal p(y)p(y) changes but the …

2018-02-12abs ↗pdf ↗

GS-B3^3SE improves label shift estimation by smoothing priors on a graph.

problem Label shift adaptation when source and target distributions share conditional but not marginal probabilities.
method Graph-Smoothed Bayesian Black-Box Shift Estimator (GS-B3^3SE) places Laplacian-Gaussian priors on log-priors and confusion-matrix columns tied by a label-similarity graph.
result GS-B3^3SE produces a tractable posterior with HMC or Newton-CG schemes, proving identifiability, contraction, and robustness.

Bayesian model explains and improves black-box estimators for class distribution.

problem Calibrating probabilistic classifiers and uncertainty quantification for unlabeled data.
method Introduced a Bayesian model approximating the ground-truth generative process, using efficient MCMC sampling.
result The Bayesian model is competitive and sometimes superior to established point estimators.

PRoFILE accurately estimates feature importance under distribution shifts.

problem Challenges in estimating feature importance under distribution shifts.
method PRoFILE uses a loss estimator trained with a causal objective to estimate feature importance.
result PRoFILE accurately estimates feature importance under complex distribution shifts.

Bayesian optimization enhanced with conformal prediction for better outcome reliability.

problem Uncertainty and model misspecification in Bayesian optimization.
method Conformal prediction to provide coverage guarantees and Bayesian optimization to select queries.
result Significant improvement in query coverage without sacrificing sample-efficiency.

We present a black-box adversarial attack algorithm which sets new state-of-the-art model evasion rates for query efficiency in the \ell_\infty and 2\ell_2 metrics, where only loss-oracle access to the model is available. On two public black-box attack challenges, the algorithm achieves the highest evasion rate, sur…

2019-02-19abs ↗pdf ↗

LIME is a popular approach for explaining a black-box prediction through an interpretable model that is trained on instances in the vicinity of the predicted instance. To generate these instances, LIME randomly selects a subset of the non-zero features of the predicted instance. After that, the perturbed instances are …

2019-10-31abs ↗pdf ↗

Proposes a method to use external machine-learning predictions in multinomial logistic regression.

problem Improving statistical inference using summary-level external machine-learning predictions.
method Empirical-likelihood framework incorporating moment constraints from external nonparametric machine-learning predictions.
result Fused estimator achieves strict efficiency gain over primary-only estimator under mild conditions.

New method calibrates neural network uncertainty for medical images.

problem Uncalibrated probabilistic outputs from deep neural networks in medical diagnosis.
method Functional space variational inference for Bayesian neural networks.
result Better calibrated uncertainty estimates at lower computational cost.

We address challenges in collaborative black-box optimization through three frameworks.

problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.

Theory establishes optimal rates for estimating linear functionals without structural assumptions.

problem Estimating linear functionals of unknown nuisance components without structural assumptions.
method Structure-agnostic framework, doubly robust estimators, first-order debiasing.
result Characterization of minimax optimal rates and regimes for double robustness.

FIT evaluates time series model feature importance quantifying distributional shift.

problem Lack of explanations for time series models in high-stakes applications.
method FIT framework quantifies feature importance based on distributional shift using KL-divergence.
result FIT identifies important time points and observations superiorly compared to baselines.

New methods adapt conformal prediction to unknown subpopulation shifts.

problem Failure of conformal prediction under unknown subpopulation shifts.
method Proposes new methods that adapt conformal prediction to unknown subpopulation shifts without explicit subpopulation labels.
result Ensures valid coverage guarantees without explicit knowledge of subpopulation structure.

Unified learning bound for covariate and concept shifts.

problem Generalization under distribution shift in machine learning.
method Support-agnostic definitions of covariate and concept shifts using entropic optimal transport, leading to a unified error bound applicable to various loss functions and label spaces.
result Development of estimators for shifts with concentration guarantees and the DataShifts algorithm for quantifying and estimating the error bound.

Paper proposes SJS model to estimate model performance under covariate and label shifts.

problem Estimating model performance when both covariates and labels shift.
method Sparse Joint Shift (SJS) model and SEES algorithm.
result SEES achieves significant shift estimation error improvements over existing approaches.

Develops black-box methods to estimate parameters of complex models.

problem Lack of efficient methods to produce simulations for complex statistical models.
method Pre-training deep neural networks on extensive simulated databases for well-structured likelihoods. Iterative algorithm for other complex dependencies.
result Successfully estimates and quantifies uncertainty of parameters from non-Gaussian models.

ALFI improves likelihood-free inference for black-box generators.

problem Limitations of likelihood-free inference on black-box generators.
method Adversarial Likelihood-Free Inference (ALFI) to estimate posterior distributions.
result ALFI achieves best parameter estimation accuracy with limited simulation.

Estimates calibration error under label shift without labels.

problem Ensuring model reliability in the face of dataset shift without access to labels.
method Importance re-weighting of the labeled source distribution to estimate calibration error under label shift.
result Effective and reliable CE estimation with respect to the shifted target distribution.

Proposes a method to stabilize Black Box Variational Inference using the James-Stein estimator.

problem Stability issues and fine-tuning required in basic Black Box Variational Inference.
method Reframe stochastic gradient ascent as multivariate estimation problem using James-Stein estimator.
result Provides a simpler method with consistent performance in terms of model fit and convergence time.

New framework converts offline to online estimation using black-box offline estimators.

problem Convert offline estimation algorithms to online estimation algorithms.
method Oracle-Efficient Online Estimation (OEOE) framework.
result Achieves near-optimal online estimation error via black-box offline estimators.

Simple method improves uncertainty estimation for distribution shifts.

problem Improving uncertainty estimation in deep image classification under distribution shifts.
method Exposing original model to corrupted images and performing simple statistical calibration.
result Superior performance on various distribution shifts and unsupervised domain adaptation tasks.

COMPASS improves uncertainty quantification for medical segmentation metrics.

problem Uncertainty quantification for medical segmentation metrics is crucial for clinical decision-making.
method COMPASS leverages deep neural network inductive biases to generate efficient, metric-based conformal prediction intervals.
result COMPASS produces significantly tighter intervals than traditional conformal prediction methods on medical image segmentation tasks.

Study shows explanation disparities in machine learning models are influenced by data and model properties.

problem Disparities in post-hoc machine learning explanation methods across race and gender.
method Simulations and experiments on a real-world dataset to assess challenges to explanation disparities.
result Increased covariate shift, concept shift, and omission of covariates increase explanation disparities, especially for neural network models.

New estimator handles covariate shift with closed-form solution and super-efficiency.

problem Handling covariate shift in missing data and causal inference problems.
method Minimum Wasserstein distance estimation framework.
result Closed-form expression and super-efficiency relative to semiparametric efficient estimator.

Bayesian framework improves uncertainty estimates under covariate shifts.

problem Neural networks' unreliable uncertainty estimates under covariate shifts.
method Adaptive prior conditioned on training and new covariates, amortized variational inference.
result Significantly improved uncertainty estimates under distribution shifts.

Paper tackles unbounded density ratio estimation for covariate shift adaptation.

problem Understudied challenge in statistical learning: unbounded density ratios.
method Three-step estimation method: relative density ratio, truncation, and transformation.
result Established rigorous convergence guarantees for density ratio and regression estimators.

New estimator optimizes black-box model errors in semiparametric estimation.

problem How nuisance estimation errors affect low-dimensional target parameters in semiparametric models.
method Proposed a new estimator achieving a sharper rate of convergence.
result The first-order stochastic error of nuisance estimation can be eliminated.

New method optimizes black-box functions using generative models and Wasserstein distance.

problem Optimizing black-box functions with stochastic responses in high dimensions.
method Deep generative surrogate models and Wasserstein distance for uncertainty estimation.
result Method outperforms state-of-the-art methods in robustness to function shape and stochasticity.

The classical shift retrieval problem considers two signals in vector form that are related by a shift. The problem is of great importance in many applications and is typically solved by maximizing the cross-correlation between the two signals. Inspired by compressive sensing, in this paper, we seek to estimate the shi…

2013-03-20abs ↗pdf ↗

Divide-and-conquer framework speeds up black-box inference for large data.

problem Computational intractability of uncertainty quantification for expensive data simulation.
method Divide data into partitions, train on a subset, bootstrap on partitions, combine results.
result Feasibility of estimating max-stable process parameters with tens of thousands of locations.

This paper establishes non-asymptotic learning bounds for the DR covariate shift adaptation.

problem Distribution shift between training and test domains in machine learning.
method Doubly-robust (DR) estimator combining density ratio estimation and pilot regression model.
result First non-asymptotic learning bounds for DR covariate shift adaptation.