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

0.3%0.5%0.8%0.2% · Aug 201619922001200920172026
10 results for G-estimation

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.

A method combines deep learning and G-estimation for causal mediation analysis.

problem Estimating structural mediation parameters under unmeasured confounding.
method UNIT method using TARNet for representation learning and G-estimation.
result Improved precision of structural parameter estimator through better representation learning.

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.

This work constructs a hypothesis test for detecting whether an data-generating function h:RpRh: R^p \rightarrow R belongs to a specific reproducing kernel Hilbert space H0\mathcal{H}_0 , where the structure of H0\mathcal{H}_0 is only partially known. Utilizing the theory of reproducing kernels, we reduce this hypothesis …

2017-10-03abs ↗pdf ↗

Learning exists in the context of data, yet notions of confidence typically focus on model predictions, not label quality. Confident learning (CL) is an alternative approach which focuses instead on label quality by characterizing and identifying label errors in datasets, based on the principles of pruning noisy data, …

2019-10-31abs ↗pdf ↗

The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we ask: is it possible to assess how far we are from the global maximum of the likel…

2016-08-18abs ↗pdf ↗

Review of methods enabling causal predictions under hypothetical interventions.

problem Need for predicting outcomes under hypothetical interventions in decision making.
method Systematic review of methods using causal inference for prediction models.
result Identified 13 methods for causal inference from observational data.

Randomness is crucial for stability in learning and statistics, especially for differential privacy.

problem Quantifying the amount of randomness needed for algorithmic stability.
method Weak-to-strong boosting theorem for stability, characterizing randomness complexity of PAC Learning.
result Randomness complexity is tightly controlled by the best replication probability of any deterministic algorithm solving the task.