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.
When training a machine learning model with observational data, it is often encountered that some values are systemically missing. Learning from the incomplete data in which the missingness depends on some covariates may lead to biased estimation of parameters and even harm the fairness of decision outcome. This paper …
We develop a theory of chain complex double-cobordism for chain complexes equipped with Poincaré duality. The resulting double-cobordism groups are a refinement of Ranicki's torsion algebraic L-groups for localisations of a commutative ring with involution. The refinement is analogous to the difference between metabo…
Proposes a robust method for predicting missing outcomes in covariate shift adaptation.
problem Predicting missing outcomes in test data with covariate shift.
method Doubly robust estimator for covariate shift adaptation via importance weighting, incorporating an additional estimator for the regression function.
result Shows robustness against density-ratio estimation errors, maintaining consistency if either estimator is consistent.
A knot in the three-sphere is doubly slice if it is the cross-section of an unknotted two-sphere in the four-sphere. For low-crossing knots, the most complete work to date gives a classification of doubly slice knots through 9 crossings. We extend that work through 12 crossings, resolving all but four cases among the 2…
We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …
We develop new algebraic methods refining the Witt group of linking forms and Ranicki's torsion algebraic L-groups into double Witt groups and double L-groups. At each prime ideal of the underlying ring, our double Witt groups capture infinitely many more integral signatures of the linking form than the single Witt gro…
We propose a semiparametric test to evaluate (i) whether different instruments induce subpopulations of compliers with the same observable characteristics on average, and (ii) whether compliers have observable characteristics that are the same as the full population on average. The test is a flexible robustness check f…
We construct an infinite family of smoothly slice knots that we prove are topologically doubly slice. Using the correction terms coming from Heegaard Floer homology, we show that none of these knots is smoothly doubly slice. We use these knots to show that the subgroup of the double concordance group consisting of smoo…
For ℓ>1, we develop L(2)-signature obstructions for (4ℓ−3)-dimensional knots with metabelian knot groups to be doubly slice. For each ℓ>1, we construct an infinite family of knots on which our obstructions are non-zero, but for which double sliceness is not obstructed by any previously known invari…
The difference between slice and doubly-slice knots is reflected in algebra by the difference between metabolic and hyperbolic Blanchfield linking forms. We exploit this algebraic distinction to refine the classical Witt group of linking forms by defining a `double Witt group' of linking forms. We calculate the double …
Off-policy evaluation (OPE) in reinforcement learning allows one to evaluate novel decision policies without needing to conduct exploration, which is often costly or otherwise infeasible. We consider for the first time the semiparametric efficiency limits of OPE in Markov decision processes (MDPs), where actions, rewar…
We study the problem of off-policy critic evaluation in several variants of value-based off-policy actor-critic algorithms. Off-policy actor-critic algorithms require an off-policy critic evaluation step, to estimate the value of the new policy after every policy gradient update. Despite enormous success of off-policy …
Doubly robust self-training improves semi-supervised learning by balancing labeled and pseudo-labeled data.
problem Improving semi-supervised learning performance with limited labeled data.
method Introduces doubly robust self-training, a method that combines labeled and pseudo-labeled data to balance between labeled-only and pseudo-labeled-only training.
result Demonstrates superior performance of doubly robust self-training on ImageNet and nuScenes datasets.
While model selection is a well-studied topic in parametric and nonparametric regression or density estimation, selection of possibly high-dimensional nuisance parameters in semiparametric problems is far less developed. In this paper, we propose a selective machine learning framework for making inferences about a fini…
The consistency of doubly robust estimators relies on consistent estimation of at least one of two nuisance regression parameters. In moderate to large dimensions, the use of flexible data-adaptive regression estimators may aid in achieving this consistency. However, n1/2-consistency of doubly robust estimators is…