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,742 papers · 148 categories

Trend · papers per month

185371556741 · Jun 202019922001200920172026
48 results for average dose-response function

Proposes a method to estimate causal effects of continuous treatments using instrumental variables.

problem Estimating causal effects of continuous treatments in the presence of unmeasured confounders.
method Introduces a novel framework using instrumental variables and a uniform regular weighting function to identify and estimate average dose-response functions.
result Establishes the asymptotic properties of the proposed methods for estimating average dose-response functions.

Proposes DeepSDRF for continuous treatment recommendation from clinical survival data.

problem Continuous treatment recommendation in medical settings with survival data.
method Deep Survival Dose Response Function (DeepSDRF) for learning conditional average dose response (CADR) function.
result Similar performance of recommender algorithms based on random search and reinforcement learning.

SHIFT improves robustness in estimating dose-response functions with heavy-tailed contamination.

problem Outliers bias estimates of average dose-response functions in heavy-tailed data.
method SHIFT combines cross-fit nuisance orthogonalization, Welsch-loss, and defensive OLS refit.
result SHIFT reduces RMSE from 1.03 to 0.33 on localized contamination test.

Proposes a method for generating prediction intervals in dose-response models using conformal prediction.

problem Uncertainty quantification in continuous treatments for personalized healthcare decisions.
method Causal dose-response problem framed as covariate shift, using weighted conformal prediction with propensity estimation and kernel functions.
result Demonstrates the significance of covariate shift assumptions for robust prediction intervals.

Method bounds continuous-valued treatment effects when confounding variables are hidden.

problem Inferring causal effects of continuous treatments when hidden confounders are present.
method Novel methodology to bound average and conditional average continuous-valued treatment effects.
result Method gives tighter coverage of true dose-response curve than existing methods.

Paper develops methods to estimate derivative of dose-response curve for continuous treatments.

problem Estimating the derivative of the dose-response curve for continuous treatments.
method Doubly robust (DR) inference method using kernel smoothing, bias-corrected IPW and DR estimators.
result Proposes novel bias-corrected IPW and DR estimators for continuous treatments.

Controlled interventions provide the most direct source of information for learning causal effects. In particular, a dose-response curve can be learned by varying the treatment level and observing the corresponding outcomes. However, interventions can be expensive and time-consuming. Observational data, where the treat…

2016-05-05abs ↗pdf ↗

Proposes estimators for complex dose-response curves using kernel methods.

problem Estimating complex dose-response curves with continuous treatments, mediators, and covariates.
method Kernel ridge regression with sequential kernel embedding technique.
result Simple estimators for mediated and time-varying dose response curves with nonasymptotic uniform rates.

Exploratory cancer drug studies test multiple tumor cell lines against multiple candidate drugs. The goal in each paired (cell line, drug) experiment is to map out the dose-response curve of the cell line as the dose level of the drug increases. We propose Bayesian Tensor Filtering (BTF), a hierarchical Bayesian model …

2019-06-10abs ↗pdf ↗

Proposes VCNet for estimating ADRFs of continuous treatments.

problem Estimating ADRFs of continuous treatments from observational data.
method VCNet for improved model expressiveness and continuity; targeted regularization for finite sample performance.
result Improves model expressiveness and continuity of ADRFs.

ContiVAE estimates individual dose-response curves from unobserved confounders using observational data.

problem Estimating causal effects of continuous treatments considering unobserved confounders.
method Variational auto-encoder with a Tilted Gaussian prior distribution modeling hidden confounders as latent variables.
result ContiVAE outperforms existing methods by up to 62% in predicting individual dose-response curves.

Proposes a new method for estimating non-pathwise differentiable functional parameters.

problem Estimating dose-response curves for continuous exposure.
method Targeted Highly Adaptive Lasso (HAL) for non-pathwise differentiable functional parameters.
result The Targeted HAL-MLE achieves dimension-free rates up to log(n) factors and outperforms other methods in simulations.

Kernel methods identify treatment effects with unobserved confounding using negative controls.

problem Learning causal relationships with unmeasured confounding.
method Kernel ridge regression algorithms for nonparametric treatment effects.
result Uniform consistency and finite sample rates of convergence proved.

Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.

problem Estimating smooth Hilbert-valued parameters with theoretical guarantees.
method Pathwise differentiable Hilbert-valued parameters, efficient influence functions, regularized one-step estimators.
result Theoretical guarantees for efficient estimators even when nuisance functions are arbitrary.

Develops a scalable model for drug combination prediction in cancer.

problem Accurate prediction of drug combinations for cancer treatment.
method Permutation invariant multi-output Gaussian Processes with variational approximation and deep generative model.
result Model efficiently borrows information across drug combinations and provides uncertainty quantification.

Develops scalable methods to assess sensitivity and uncertainty in continuous treatment effects.

problem Estimating effects of continuous-valued interventions from observational data, especially when ignorability and positivity assumptions are violated.
method Continuous treatment-effect marginal sensitivity model (CMSM), scalable algorithm, uncertainty-aware deep models.
result Derives bounds that agree with observed data and a defined level of hidden confounding.

New method estimates extreme outcomes in heavy-tailed data, breaking circular dependence.

problem Estimating outcomes for extreme events in heavy-tailed data.
method Proposes an ADRF estimator that includes a structured tail-shape output and a diagnostic to evaluate tail shape.
result Successfully reduces MAE in deep-tail and conditional-shortfall predictions.

The literature of heavy tails (typically) starts with a random walk and finds mechanisms that lead to fat tails under aggregation. We follow the inverse route and show how starting with fat tails we get to thin-tails when deriving the probability distribution of the response to a random variable. We introduce a general…

2013-07-25abs ↗pdf ↗

A new algorithm uses concavity in Gaussian processes to optimize decisions in bandit problems.

problem Optimizing decisions in sequential problems with context-dependent rewards.
method Proposes a UCB algorithm using a shape-constrained reward function estimator based on a Gaussian Process model with concavity constraints.
result Derives regret bounds for the proposed UCB algorithm.

Proposes a new method to measure and avoid harm in machine learning decisions.

problem Measuring and avoiding harm in machine learning algorithms.
method Formal definition of harm and benefit using causal models, counterfactual objective functions.
result Demonstrates that standard machine learning methods can lead to harmful policies under distributional shifts.

Mixed effects (ME) models inform a vast array of problems in the physical and social sciences, and are pervasive in meta-analysis. We consider ME models where the random effects component is linear. We then develop an efficient approach for a broad problem class that allows nonlinear measurements, priors, and constrain…

2019-09-24abs ↗pdf ↗

New theory for nonsmooth systems helps optimize and control complex functions.

problem Optimizing and controlling systems with nonsmooth functions.
method Higher-order averaging theory with nonsmooth near-identity transformation and lexicographic differentiation.
result Closed formula for nonsmooth first and second-order averaging.

Kernel ridge regression for causal inference with missing data.

problem Estimating treatment effects with missing data in selected samples.
method Kernel ridge regression estimators for nonparametric dose response curves and semiparametric treatment effects.
result Uniform consistency and finite sample rates for continuous treatment, root-n consistency for discrete treatment.

Study Q-learning with averaging for reinforcement learning, proving efficient inference and error bounds.

problem Efficient inference and error bounds for Q-learning with averaging.
method Functional central limit theorem and asymptotic linear estimator for optimal Q-value function.
result Standardized partial-sum process converges weakly to a rescaled Brownian motion, matching instance-dependent lower bound for error.

GCF estimates heterogeneous treatment effects for continuous treatments in online marketplaces.

problem Estimating heterogeneous treatment effects for continuous treatments in online marketplaces.
method Kernel-based doubly robust estimator and distance-based splitting criterion.
result GCF estimates heterogeneous treatment effects for continuous treatments effectively.

Improved bounds for Monte Carlo Rademacher Averages using self-bounding functions.

problem Proving sharper concentration bounds for MCERA.
method Deriving new bounds through self-bounding functions and concentration of measure.
result Novel bounds depend on data-dependent quantities, improving over standard methods.

Gromov proposed an averaged version of the Dehn function and claimed that in many cases it should be subasymptotic to the Dehn function. Using results on random walks in nilpotent groups, we confirm this claim for most nilpotent groups. In particular, if a nilpotent group satisfies the isoperimetric inequality $δ(l)<Cl…

2005-10-31abs ↗pdf ↗

We show Vector Autoregressive Moving Average models with scalar Moving Average components could be estimated by generalized least square (GLS) for each fixed moving average polynomial. The conditional variance of the GLS model is the concentrated covariant matrix of the moving average process. Under GLS the likelihood …

2019-09-01abs ↗pdf ↗

Improved TD learning with tail averaging and regularization achieves optimal convergence rates.

problem Convergence analysis of TD learning with linear function approximation.
method Tail-averaging and regularization applied to TD learning algorithm.
result Achieves optimal O(1/t)O(1/t) convergence rate in expectation and with high probability.

Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.

problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.

UCRL2-VTR achieves nearly optimal regret for learning MDPs with linear function approximation.

problem Learning infinite-horizon average-reward MDPs with linear function approximation.
method UCRL2-VTR algorithm with Bernstein-type bonus.
result Achieves a regret of ildeO(dDT) ilde{O}(d\sqrt{DT}) with matching lower bound.

Efficient algorithm for global optimization of multivariate Lipschitz functions.

problem Global optimization of multivariate Lipschitz continuous functions.
method Proposes an efficient minimax optimal algorithm using a predetermined query creation rule.
result Achieves an average regret bound of O(LnT1n)O(L\sqrt{n}T^{-\frac{1}{n}}), minimax optimal.

Kernel-based function approximation improves reinforcement learning performance.

problem Average reward reinforcement learning in infinite horizon settings.
method Optimistic algorithm based on kernel ridge regression.
result No-regret performance guarantees and confidence intervals for kernel-based predictions.

This paper analyzes SGD with increasingly weighted averaging for optimization and generalization.

problem Improving optimization and generalization for non-strongly convex objectives.
method Comprehensive analysis of increasingly weighted averaging schemes for convex, strongly convex, and non-convex objectives.
result The weight αα affects both optimization and generalization errors, revealing a trade-off.

We analyze the question whether sliding window time averages applied to stationary increment processes converge to a limit in probability. The question centers on averages, correlations, and densities constructed via time averages of the increment x(t,T)=x(t+T)-x(t)and the assumption is that the increment is distribute…

2008-04-06abs ↗pdf ↗

In this thesis, we consider the suitability of using the charged cold fluid model in the description of ultra-relativistic beams. The method that we have used is the following. Firstly, the necessary notions of kinetic theory and differential geometry of second order differential equations are explained. Then an averag…

2012-06-19abs ↗pdf ↗

The paper analyzes MACD using operator theory.

problem Understanding the mathematical foundation of MACD.
method Developed a functional-analytic framework interpreting MACD as a phase-corrected, smoothed derivative operator.
result MACD is structurally equivalent to a band-pass filter and can be expressed as a finite difference of delayed and doubly averaged signals.