skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on January 1, 2026

Title: Variational analysis of proximal compositions and integral proximal mixtures
Award ID(s):
2211123
PAR ID:
10597610
Author(s) / Creator(s):
;
Publisher / Repository:
Evolution Equations and Control Theory
Date Published:
Journal Name:
Evolution Equations and Control Theory
Volume:
0
Issue:
0
ISSN:
2163-2480
Page Range / eLocation ID:
1 to 34
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Summary A common concern when trying to draw causal inferences from observational data is that the measured covariates are insufficiently rich to account for all sources of confounding. In practice, many of the covariates may only be proxies of the latent confounding mechanism. Recent work has shown that in certain settings where the standard no-unmeasured-confounding assumption fails, proxy variables can be leveraged to identify causal effects. Results currently exist for the total causal effect of an intervention, but little consideration has been given to learning about the direct or indirect pathways of the effect through a mediator variable. In this work, we describe three separate proximal identification results for natural direct and indirect effects in the presence of unmeasured confounding. We then develop a semiparametric framework for inference on natural direct and indirect effects, which leads us to locally efficient, multiply robust estimators. 
    more » « less
  2. For G a Polish group, we consider G-flows which either contain a comeager orbit or have all orbits meager. We single out a class of flows, the maximally highly proximal (MHP) flows, for which this analysis is particularly nice. In the former case, we provide a complete structure theorem for flows containing comeager orbits, generalizing theorems of Melleray, Nguyen Van Thé, and Tsankov and of Ben Yaacov, Melleray, and Tsankov. In the latter, we show that any minimal MHP flow with all orbits meager has a metrizable factor with all orbits meager, thus ‘reflecting’ complicated dynamical behavior to metrizable flows. We then apply this to obtain a structure theorem for Polish groups whose universal minimal flow is distal. 
    more » « less
  3. null (Ed.)
    Underpinning the success of deep learning is effective regularizations that allow a variety of priors in data to be modeled. For example, robustness to adversarial perturbations, and correlations between multiple modalities. However, most regularizers are specified in terms of hidden layer outputs, which are not themselves optimization variables. In contrast to prevalent methods that optimize them indirectly through model weights, we propose inserting proximal mapping as a new layer to the deep network, which directly and explicitly produces well regularized hidden layer outputs. The resulting technique is shown well connected to kernel warping and dropout, and novel algorithms were developed for robust temporal learning and multiview modeling, both outperforming state-of-the-art methods. 
    more » « less