SearcharxivSearch

arXiv subjects

David Hubbard

Publications and source records attributed to David Hubbard.

7 recordsLinked to original sources

Semiparametric Double Reinforcement Learning with Applications to Long-Term Causal Inference

Double reinforcement learning (DRL) provides efficient off-policy inference for policy values in nonparametric Markov decision processes (MDPs), but fully nonparametric estimators can be unstable when intertemporal overlap is weak and occupancy ratios are high-dimensional. This limitation is especially relevant for long-term causal inference from randomized experiments: randomization ensures overlap in treatment assignment, but not over future state trajectories induced by continued intervention use. We develop semiparametric DRL for continuous linear functionals of the infinite-horizon $Q$-function. Rather than impose linear MDP structure on the reward and transition laws, we place working semiparametric restrictions on the $Q$-function itself, the solution of the discounted Bellman equation. When correct, these restrictions can improve efficiency relative to unrestricted DRL while allowing rich, possibly infinite-dimensional models. To avoid relying on correct specification, we define the estimand through weighted Bellman-residual minimization. The resulting projection target remains meaningful under misspecification and recovers the original functional under correct specification. For this class of parameters, we derive efficient influence functions and efficiency bounds, construct model-robust automatically debiased estimators, and develop minimax criteria for estimating the $Q$- and Riesz functions. Under correct specification, optimally weighted versions attain the semiparametric efficiency bound in the restricted model.

stat.ML

Explicit bounds on common projective torsion points of elliptic curves

Suppose E_1, E_2 are elliptic curves (over the complex numbers) together with standard double coverings of the projective line identifying a point and its inverse on E_i. Bogomolov, Fu and Tschinkel have asked if the number of common images of torsion points on the elliptic curves under these double coverings is uniformly bounded in the case when the branch loci of the double coverings do not coincide, and recently this was answered affirmatively by various authors, but realistic effective bounds are unknown. In this article we obtain such bounds for common projective torsion points on elliptic curves under some mild extra assumptions on the reduction type of the input data at given primes. The method is based on Raynaud's original groundbreaking work on the Manin-Mumford conjecture. In particular, we generalise several of his results to cases of bad reduction using techniques from logarithmic algebraic geometry.

math.AG

Roots of unity and projective equivalence

Existing results of Fu show that, if two finite sets of roots of unity are projectively equivalent by a projective automorphism that does not act bijectively on the set of all roots of unity, then these sets consist of at most 14 points. Moreover, Fu constructs the two possible maximal sets, which are unique up to projective equivalence. In this article, we give an elementary proof that the cardinality of two such sets is at most 18 using the methods of Beukers and Smyth. Moreover, we show precisely how their method fails to give the tightest bound in the maximal cases of Fu.

math.AG

Beta Survival Models

This article analyzes the problem of estimating the time until an event occurs, also known as survival modeling. We observe through substantial experiments on large real-world datasets and use-cases that populations are largely heterogeneous. Sub-populations have different mean and variance in their survival rates requiring flexible models that capture heterogeneity. We leverage a classical extension of the logistic function into the survival setting to characterize unobserved heterogeneity using the beta distribution. This yields insights into the geometry of the problem as well as efficient estimation methods for linear, tree and neural network models that adjust the beta distribution based on observed covariates. We also show that the additional information captured by the beta distribution leads to interesting ranking implications as we determine who is most-at-risk. We show theoretically that the ranking is variable as we forecast forward in time and prove that pairwise comparisons of survival remain transitive. Empirical results using large-scale datasets across two use-cases (online conversions and retention modeling), demonstrate the competitiveness of the method. The simplicity of the method and its ability to capture skew in the data makes it a viable alternative to standard techniques particularly when we are interested in the time to event and when the underlying probabilities are heterogeneous.

cs.LG

Explicit computations in Iwasawa theory

We give two algorithms to compute layers of the anticyclotomic ${\bf Z}_3$-extension of an imaginary quadratic field. The first is based on complex multiplication techniques for nonmaximal orders; the second is based on Kummer theory. As an illustration of our results, we use the mirroring principle to derive results on the structure of class groups of nonmaximal orders.

math.NT

Kummer generators and lambda invariants

Let $F_0=\mathbf Q(\sqrt{-d})$ be an imaginary quadratic field with $3\nmid d$ and let $K_0=\mathbf Q(\sqrt{3d})$. Let $\varepsilon_0$ be the fundamental unit of $K_0$ and let $λ$ be the Iwasawa $λ$-invariant for the cyclotomic $\mathbf Z_3$-extension of $F_0$. The theory of 3-adic $L$-functions gives conditions for $λ\ge 2$ in terms of $ε_0$ and the class numbers of $F_0$ and $K_0$. We construct units of $K_1$, the first level of the $\mathbf Z_3$-extension of $K_0$, that potentially occur as Kummer generators of unramified extensions of $F_1(ζ_3)$ and which give an algebraic interpretation of the condition that $λ\ge 2$. We also discuss similar results on $λ\ge 2$ that arise from work of Gross-Koblitz.

math.NT