Solves inconsistent estimation for Neyman-Scott problems.
problem Inconsistent estimation for Neyman-Scott problems.
method RKL estimator, invariant to representation, consistent over any non-degenerate prior.
result General-purpose Bayes estimator for Neyman-Scott that is consistent and invariant.
Develops a direct debiased machine learning framework using Bregman divergence.
problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.
Adaptive designs achieve strong Neyman regret guarantees for ATE estimation.
problem Estimating unbiased average treatment effect in sequential experiments.
method Proposed adaptive designs with O ~ ( log T ) \widetilde{O}(\log T) O ( log T ) Neyman regret under boundedness assumptions and O ~ ( T ) \widetilde{O}(\sqrt{T}) O ( T ) multigroup Neyman regret in covariate-based settings. result Adaptive designs outperform non-adaptive designs in terms of Neyman regret, especially in covariate-based settings.
New bounds for Neyman-Pearson region using f f f -divergences.
problem Bounding the Neyman-Pearson region for hypothesis testing.
method Establishing novel lower and upper bounds using f f f -divergences. result Best possible lower bound for the Neyman-Pearson boundary using hockey-stick f f f -divergences. Develops NPMC method for noisy labels, improving multiclass classification accuracy.
problem Asymmetric misclassification costs and label noise in multiclass classification.
method Empirical likelihood approach using exponential tilting density ratio model.
result Root n consistent and asymptotically normal estimators for clean labels and noise mechanism.
Neyman's framework evaluates personalized treatment rules using experiments.
problem Evaluating the efficacy of individualized treatment rules derived by machine learning.
method Neyman's repeated sampling framework applied to cross-fitted ITRs.
result Ex-post evaluation of ITRs can be more efficient than random assignment.
A deep Neyman-Scott process uses Poisson processes for efficient inference in complex point processes.
problem Efficient inference in complex hierarchical point processes.
method Developed an efficient posterior sampling via Markov chain Monte Carlo for likelihood-based inference.
result More hidden Poisson processes improve likelihood fitting and event prediction.
Optimal strategy found for identifying best arm in bandits with small gap.
problem Best arm identification in two-armed bandits with a fixed budget and small gap.
method Neyman allocation rule augmented with inverse probability weighting.
result Proposed strategy is asymptotically optimal when gap is small.
GNA optimally identifies the best arm with small gaps.
problem Best arm identification in fixed-budget settings.
method Generalized Neyman Allocation (GNA) for asymptotically locally minimax optimal BAI.
result GNA's worst-case bounds match the lower and upper bounds in the small-gap regime.
Adapts Neyman-Pearson classification for both source and target distribution shifts.
problem Minimizing errors while controlling both Type-I and Type-II errors under distribution shifts.
method Derives an adaptive procedure that guarantees improved error rates and adapts to uninformative sources.
result Automatic adaptation to uninformative sources avoids negative transfer.
Unified framework for debiased machine learning using Riesz representer and Bregman divergence.
problem Estimating causal and structural parameters in machine learning.
method Generalized Riesz regression for fitting Riesz representer via Bregman divergence minimization.
result Automatic covariate balancing and Neyman orthogonality properties for debiased estimation.
New method for clustering tasks with heterogeneous data.
problem Clustered multitask learning with semiparametric and heterogeneous nuisances.
method Adaptive fused orthogonal estimator with Neyman-orthogonal losses and data-driven fusion penalties.
result Achieves exact clustering recovery and pooled parametric convergence rates.
Study shows MML is not consistent for Neyman-Scott problem.
problem Neyman-Scott estimation problem
method Novel techniques for direct analysis of SMML solutions
result SMML and its approximations are not consistent for Neyman-Scott problem
Paper proposes ClipSMT algorithm for better ATE estimation.
problem Adaptive estimation of Average Treatment Effect (ATE).
method ClipSMT algorithm for improved Neyman regret.
result Achieves exponential improvements in Neyman regret.
Optimal algorithm for identifying best-arm with minimal regret.
problem Identifying the best arm in two treatments with limited budget.
method Neyman allocation based on outcome standard deviations.
result Neyman allocation is minimax optimal for simple regret.
Combines cost-sensitive and Neyman-Pearson paradigms for better binary classification.
problem Asymmetric binary classification problems with unequal error severities.
method Develops TUBE-CS algorithm to bridge cost-sensitive and Neyman-Pearson paradigms.
result High-probability control of population type I error.
Develops variational inference for Neyman-Scott processes for faster sampling.
problem Slow mixing time in MCMC for posterior sampling in Neyman-Scott processes.
method Variational inference algorithm for Neyman-Scott processes, minimizing KL divergence.
result Achieves better prediction performance than MCMC with limited computational time.
Neyman-Pearson testing improves goodness of fit in detecting new physics.
problem Detecting small anomalies in data distributions.
method Employing Neyman-Pearson strategy with a rich parametrized family of models.
result Neyman-Pearson testing is more sensitive to small departures and unbiased towards specific anomalies.
Novel connections between Neyman-Scott processes and Bayesian nonparametric mixture models enable scalable inference.
problem Efficiently modeling and detecting clusters in spatiotemporal data.
method Adapting collapsed Gibbs sampling for Neyman-Scott processes via connections to mixture of finite mixture models.
result Demonstrated scalability and effectiveness on neural spike trains and document streams.
Characterizes distribution-free rates in unbalanced classification problems.
problem Minimizing error under two different distributions in unbalanced settings.
method Characterizes minimax rates over all pairs of distributions using a geometric condition.
result Identifies a dichotomy between hard and easy classes based on a three-points-separation condition.
New method estimates treatment effects using machine learning.
problem Estimating treatment effects from observational data.
method Double/de-biased machine learning with Neyman-orthogonal scores and cross-fitting.
result Valid inferential statements about treatment effects.
Paper proposes cost-sensitive detection for environmental acoustic sensing.
problem Infeasibility of manual analysis for large-scale acoustic data.
method Cost-sensitive classification with variational autoencoders in Neyman-Pearson framework.
result Improved control over false positive and false negative rates.
The paper argues for using Neyman orthogonal score for balancing in debiased machine learning.
problem Debiased machine learning requires a proper approach to balance covariates.
method The paper advocates for using Riesz regression with basis functions of X for balancing.
result Covariate balancing is only valid when the score-relevant regression error is a function of covariates alone.
The paper offers methods to estimate causal functions using machine learning.
problem Estimating causal effects and their derivatives accurately.
method Neyman-orthogonal signal adjustment, best linear predictor, Gaussian bootstrap inference.
result Automatic targeting of smooth structural functions and group average effects.
New convergence guarantees for learning with unknown nuisance parameters.
problem Learning problems with unknown nuisance parameters.
method Stochastic gradient optimization with Neyman orthogonality and approximately orthogonalized updates.
result Stochastic gradient algorithms can converge under conditions of nuisance parameters.
ScoreMatchingRiesz improves debiased machine learning and policy effects estimation.
problem Improving debiased machine learning and policy effects estimation.
method Score matching and Riesz representer estimation.
result Estimates policy path for continuous treatments, improving interpretability.
The paper tackles Neyman-Pearson classification control issues.
problem Neyman-Pearson classification's control constraint is hard to satisfy in finite samples.
method Developed refined learning procedures under two accuracy control strategies.
result Proposed methods achieve desired control levels in finite samples.
New criterion improves domain adaptation performance.
problem Binary classification in a target domain with unlabeled data and domain shift.
method Introduces a generalized Neyman-Pearson criterion for optimal domain adaptation.
result Stronger domain adaptation results possible with new criterion.
Unified framework for Bayes-optimal classifiers under group fairness.
problem Mitigating disparate impacts from algorithmic predictions in high-stakes decision-making.
method Unified framework based on Neyman-Pearson argument for deriving Bayes-optimal classifiers under group fairness constraints.
result Proposes FairBayes method that directly controls disparity and achieves optimal fairness-accuracy tradeoff.
New method corrects bias in density ratio estimation for missing data.
problem Missing data bias in density ratio estimation.
method Adapted KLIEP method (M-KLIEP) for MNAR data.
result M-KLIEP restores consistency and minimax optimality.
Develops algorithms for multi-class Neyman-Pearson classification with cost sensitivity.
problem Asymmetric misclassification costs in multi-class classification problems.
method Establishes connection with cost-sensitive learning, proposes two algorithms, extends NP oracle properties.
result Proposes algorithms with theoretical guarantees for multi-class Neyman-Pearson classification.
Most existing binary classification methods target on the optimization of the overall classification risk and may fail to serve some real-world applications such as cancer diagnosis, where users are more concerned with the risk of misclassifying one specific class than the other. Neyman-Pearson (NP) paradigm was introd…
Paper proposes a method to detect unknown anomalous sounds without training data using deep learning and Neyman-Pearson lemma.
problem Unsupervised detection of unknown anomalous sounds in audio data.
method Uses an autoencoder to minimize reconstruction error of normal sounds and Neyman-Pearson lemma to maximize true positive rate under low false positive rate conditions.
result The proposed method improves performance measures of unsupervised anomaly detection in audio data under low false positive rate conditions.
A neural network for online NP classification with reduced complexity.
problem Online nonlinear Neyman-Pearson classification.
method Single hidden layer feedforward neural network (SLFN) initialized with random Fourier features (RFFs). Uses stochastic gradient descent for sequential learning.
result Expedited online adaptation and powerful nonlinear Neyman-Pearson modeling.
DeepBlip estimates treatment effects over time using neural networks.
problem Estimating treatment effects over time with interpretable blip effects.
method DeepBlip uses a novel double optimization trick to enable simultaneous learning of blip functions with sequential neural networks.
result DeepBlip achieves state-of-the-art performance across various clinical datasets.
Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with …
SOFARI improves inference on multi-task learning latent factors.
problem Challenges in precise inference on multi-task learning latent factor matrices.
method High-dimensional manifold-based Neyman near-orthogonality inference on Stiefel manifold structure.
result Easy-to-use bias-corrected estimators for latent factor vectors and singular values with asymptotic normal distributions.
Paper introduces GDR-learners for estimating potential outcomes from observational data.
problem Lack of theoretical property of general Neyman-orthogonality in deep generative models.
method Develops flexible GDR-learners based on various deep generative models.
result GDR-learners possess quasi-oracle efficiency and rate double robustness, asymptotically optimal.
Optimal selective classification using likelihood ratios improves model reliability.
problem Enhancing predictive model reliability by allowing uncertain predictions.
method Neyman--Pearson lemma applied to likelihood ratios for optimal selection.
result Neyman--Pearson-informed methods outperform existing baselines under covariate shifts.
Framework sharpens causal effect estimates without external assumptions.
problem Estimating causal effects under unmeasured confounding.
method Information-theoretic divergence bounds, Neyman orthogonality, machine learning.
result Sharp partial identification of conditional causal effects from observational data.
New method improves efficiency analysis with big data.
problem Challenges in detecting inefficiency with big data.
method Post Double LASSO method using Neyman orthogonal moment conditions.
result Improved estimation of efficiency and inefficiency.
Motivated by optimal investment problems in mathematical finance, we consider a variational problem of Neyman-Pearson type for law-invariant robust utility functionals and convex risk measures. Explicit solutions are found for quantile-based coherent risk measures and related utility functionals. Typically, these solut…
The paper offers methods to estimate and infer the boundary of a set-identified linear model.
problem Estimating and inferring the boundary of a set-identified linear model with many covariates.
method The paper uses semiparametric moment equations and Neyman-orthogonality combined with sample splitting to construct a root-N consistent, uniformly asymptotically Gaussian estimator and a multiplier bootstrap procedure for inference.
result The paper provides a method to estimate and infer the boundary of a set-identified linear model.
Paper proposes a deep learning method for online sequential data with multiple objectives.
problem Dealing with multiple loss functions in online deep learning tasks.
method A novel online deep learning training procedure that can handle various neural network architectures.
result Demonstrated effectiveness on the Neyman-Pearson classification problem.
New algorithm controls type I error in NP classification under label noise.
problem Label noise affects NP classification methods, reducing power.
method Proposes a label-noise-adjusted Neyman-Pearson algorithm.
result Improves power while controlling type I error under desired level.
Paper controls type I error in text classification despite data distortion.
problem Data distortion in open online platforms leads to misclassification.
method Uses Neyman-Pearson (NP) classification paradigm to minimize type I error.
result NP methods control type I error on test data despite data distortion.
The paper develops methods for causal function estimation and inference with multiway clustered data.
problem Estimation and inference for causal functions under multiway clustering.
method Two-step procedure using machine learning for nuisance parameters and projection onto basis functions.
result Rejects the null hypothesis of uniformly zero effects and reveals heterogeneous treatment effects.
Optimal statistical test for identifying edges in Gaussian graphical models.
problem Identifying the correct edges in Gaussian graphical models from a sample.
method Developed a Neyman-type multiple decision procedure to minimize the combined error rates of Type I and Type II errors.
result The developed procedure is optimal, minimizing the linear combination of Type I and Type II error rates.