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

6131925 · Jun 202019922001200920172026
48 results for Debiased Lasso

Study improves statistical inference for CATEs using Lasso and DML.

problem Estimating and inferring CATEs in high-dimensional settings.
method Doubly robust estimator, Lasso regularization, debiased Lasso, DML.
result TDL (triple/debiased Lasso) achieves n\sqrt{n}-consistency and confidence intervals.

Ridge regression is revisited with debiasing and thresholding, offering advantages over Lasso.

problem High-dimensional data challenges classical ridge regression's sparsity detection and bias issues.
method Debiasing and thresholding ridge regression, introducing a wild bootstrap for confidence regions and hypothesis testing, and a hybrid bootstrap for prediction intervals.
result Debiased and thresholded ridge regression can offer similar performance to thresholded Lasso and may be preferable in some settings.

We devise a one-shot approach to distributed sparse regression in the high-dimensional setting. The key idea is to average "debiased" or "desparsified" lasso estimators. We show the approach converges at the same rate as the lasso as long as the dataset is not split across too many machines. We also extend the approach…

2015-03-14abs ↗pdf ↗

This paper introduces metrics for welfare analysis in dynamic models. We develop estimation and inference for these parameters even in the presence of a high-dimensional state space. Examples of welfare metrics include average welfare, average marginal welfare effects, and welfare decompositions into direct and indirec…

2019-08-24abs ↗pdf ↗

The paper analyzes LASSO penalization for high-dimensional Beta regression models.

problem Theoretical analysis of LASSO in high-dimensional Beta regression.
method Non-convexity handling through a neighborhood framework, debiasing for confidence intervals, proximal gradient algorithm.
result Non-asymptotic bound on 1\ell_1-error of stationary points.

We consider the problem of distributed multi-task learning, where each machine learns a separate, but related, task. Specifically, each machine learns a linear predictor in high-dimensional space,where all tasks share the same small support. We present a communication-efficient estimator based on the debiased lasso and…

2015-10-02abs ↗pdf ↗

DWTS uses observational data to improve clinical trial efficiency.

problem Lack of definitive conclusions from randomized clinical trials due to insufficient patient cohorts and confounding biases.
method DWTS combines observational data with randomized clinical trials using Doubly Debiased LASSO (DDL) to identify reliable covariates.
result DWTS reduces cumulative regret in clinical trials compared to standard methods.

Develops a new method for uncertainty quantification in high-dimensional learning.

problem Challenges in uncertainty quantification in high-dimensional regression or learning problems.
method Data-driven approach for UQ that corrects bias terms from training data.
result Non-asymptotic confidence intervals that avoid overestimating uncertainty.

This paper introduces a novel online inference method for high-dimensional GLMs.

problem Real-time analysis of sequentially collected data in high-dimensional settings.
method Adaptive stochastic gradient descent with online debiasing for dynamic objective functions.
result Established the asymptotic normality of the Adaptive Debiased Lasso (ADL) estimator.

ADML combines debiased learning with data-driven model selection for efficient inference.

problem Debiased machine learning estimators can be unstable and biased in nonparametric models.
method Data-driven model selection techniques combined with debiased machine learning.
result ADML estimators yield superefficient inference for pathwise differentiable parameters.

Two approaches to directly estimating Riesz representer are shown to be numerically equivalent under certain conditions.

problem Estimating Riesz representer in semiparametric statistics.
method Two distinct optimization problems solved by automatic debiased machine learning and sieve methods for conditional moment models.
result Numerical equivalence of estimators under specific regularization schemes, but not for others.

DebiNet uses over-parameterized neural networks to improve linear model performance and debiasing.

problem Improving linear model performance and debiasing in high-dimensional settings.
method Incorporates over-parameterized neural networks into semi-parametric models to estimate parameters consistently.
result DebiNet offers valid inference and accurate prediction by leveraging neural networks' universal approximation and linear model's interpretability.

The Lasso method is analyzed for high-dimensional regression with Gaussian designs, leading to new insights on its performance.

problem Analyzing the Lasso method for high-dimensional regression with Gaussian designs.
method Generalizing the Lasso characterization to Gaussian correlated designs with non-singular covariance structure.
result Establishing non-asymptotic bounds on the distance between the distribution of various quantities in the two models.

Performing statistical inference in high-dimension is an outstanding challenge. A major source of difficulty is the absence of precise information on the distribution of high-dimensional estimators. Here, we consider linear regression in the high-dimensional regime pnp\gg n. In this context, we would like to perform in…

2015-08-11abs ↗pdf ↗

High-dimensional inference for sparse spectral precision matrices

problem Inference on the spectral precision matrix at a fixed frequency
method Full likelihood-based inference using neighboring discrete Fourier transforms
result Simultaneous control of regularization, finite-sample truncation, and smoothing biases

Method estimates dynamic treatment effects using machine learning and g-estimation.

problem Estimating treatment effects over time with multiple treatments and potential future outcomes.
method Double/debiased machine learning framework for dynamic treatment effects, extending Neyman orthogonal cross-fitted gg-estimation.
result Provides finite sample guarantees and allows for non-linear effect heterogeneity and high-dimensional parameterizations.

Proposes a three-stage debiasing framework to improve out-of-distribution accuracy.

problem Inaccurate uncertainty estimations in bias-only models damage ensemble-based debiasing performance.
method Calibrates the bias-only model to improve its uncertainty estimations, creating a three-stage ensemble-based debiasing framework.
result The three-stage debiasing framework consistently outperforms traditional methods in out-of-distribution accuracy.

Paper develops PGMM framework for debiased inference on nonparametric IV estimators.

problem Automatic debiased inference on nonparametric IV functionals.
method Penalized GMM (PGMM) framework for functionals of IV estimators.
result PGMM-based debiased estimator performs well, achieving near-nominal coverage.

A new method debiases multiple target parameters without IFs.

problem Debiasing multiple target parameters in nonparametric models.
method Kernel Debiased Plug-in Estimation (KDPE) using TMLE and reproducing kernel Hilbert spaces.
result KDPE simultaneously debiases all pathwise differentiable target parameters.

We consider the problem of variable selection in high-dimensional statistical models where the goal is to report a set of variables, out of many predictors X1,,XpX_1, \dotsc, X_p, that are relevant to a response of interest. For linear high-dimensional model, where the number of parameters exceeds the number of samples $(p…

2018-03-12abs ↗pdf ↗

A self-supervised debiasing method using rank regularization mitigates spurious correlations in neural networks.

problem Spurious correlations cause biases in deep neural networks, affecting generalization.
method Spectral analysis of latent representations, rank regularization, self-supervised pretraining, debiasing of downstream tasks.
result The proposed framework significantly improves generalization performance and outperforms supervised debiasing approaches.

A new debiasing method for high-dimensional regression with applications to PCR.

problem Debiasing in high-dimensional statistics with i.i.d. samples and sub-Gaussian covariates.
method Spectrum-Aware Debiasing using rescaled gradient descent with spectral information.
result Achieves debiasing in broader contexts with structured dependencies, heavy tails, and low-rank structures.

This paper evaluates debiasing methods on word embeddings to reduce religious bias.

problem Social biases persist in word embeddings, potentially amplifying them in AI applications.
method Investigates and evaluates three multiclass debiasing techniques on three word embeddings.
result ConceptorDebiasing is the most effective method, reducing religious bias by 82-96%.

A debiasing method improves nonparametric regression's statistical properties.

problem Lack of theoretical guarantees for modern nonparametric regression methods.
method Model-free debiasing method incorporating a correction term.
result Debiased estimator satisfies pointwise and uniform risk convergence, asymptotic normality.

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.

Paper develops a distributed debiased estimator for sparse statistical inference.

problem High computational costs in debiased estimator construction for high-dimensional models.
method Develops a multi-round distributed debiased estimator using both labeled and unlabelled data.
result Unlabeled data improves statistical rate of each iteration in distributed setup.

COMMOD debiases models with minimal and interpretable changes.

problem Inconsistent and costly model updates in fair machine learning.
method Introduced COMMOD, a novel algorithm for algorithmic fairness that minimizes changes and makes them interpretable.
result COMMOD achieves comparable performance to state-of-the-art debiasing methods while making minimal and interpretable changes.

A theorem for debiasing machine learning with finite sample guarantees.

problem Calculating confidence intervals for machine learning functionals.
method Debiased machine learning based on bias correction and sample splitting.
result Nonasymptotic debiased machine learning theorem with finite sample guarantees.