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

1122 · May 202419922001200920172026
14 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.

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.

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.

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 ↗

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.

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.

New scheme for sparse feature selection in networked data.

problem Sparse feature selection in distributed, communication-restricted networks.
method Distributed sparse linear regression and feature selection method.
result True causal features can be reliably recovered with minimal bandwidth usage.