TSThomas M. Surowiec

Thomas M. Surowiec

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thomas M. Surowiec has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Inference as risk identification

    by Aurya S. Javeed, Drew P. Kouri, Thomas M. Surowiec

    The Bayes posterior solves the variational problem of maximizing the expected likelihood of the data minus the Kullback–Leibler divergence from the prior distribution. We generalize Bayesian inference from this variational point of view. In particular, we introduce a variational inference (VI) problem whose solutions we call posteriors and show that these posteriors are risk identifiers, i.e., subgradients of risk measures. This insight leads to: ( i ) rigorous results concerning the existence and asymptotics of posteriors, ( ii ) the ability to constrain the divergence from the prior—which motivates a measure-valued relaxation of M-estimation that we call coherent inference —and ( iii ) insights into VI problems derived from $$\phi$$ -divergences. These insights include semi-analytical expressions for posteriors and connections with utility theory. We use the semi-analytical expressions for $$\phi$$ -divergence posteriors to numerically solve a multi-armed bandit problem.

  • Open Access

    Exponential Map Models as an Interpretable Framework for Generating Neural Spatial Representations

    by Markus Pettersen, Nicolai Haug, Joakim Bergli, Thomas Surowiec, Mikkel Elle Lepperod

    A foundational challenge in neuroscience and AI is understanding how physical space is mapped into neural representations. While artificial neural networks can learn brain-like spatial representations, their ``black-box'' nature obscures whether these representations reflect general principles or artifacts of specific architectures, objectives or optimization choices, offering no guarantee that solutions for tasks like path integration generalize beyond training data. Here, we use a first-principles framework based on the matrix exponential, in which generator matrices map physical locations to neural population vectors without gradient-based optimization. Within this formalism, navigational properties follow directly from algebraic constraints on the generators: commuting generators enable trajectory-invariant, exact path integration, while skew-symmetry yields equinorm representations with translation-invariant similarities. Preserving the flat Euclidean metric further constrains the generator spectra to balanced wavevector configurations, such as the roots-of-unity constellations that generate periodic grid fields. Similarity preservation further produces localized place-like fields, and extending the generators to a context signal models context-dependent remapping. Beyond its algebraic relation to continuous attractor and oscillatory interference models, the framework natively supports goal-oriented multi-map navigation through hyperdimensional bundling and binding, fits recorded grid and place cell data, extrapolates their rate maps far beyond the fitted region, and makes testable predictions for entorhinal circuits. By grounding spatial representations in exact algebraic conditions, this work offers a transparent alternative to empirical representation learning, revealing the conditions under which a coherent neural map of space arises.

  • Open Access

    Risk-averse optimal control of random elliptic variational inequalities

    by Amal Alphonse, Caroline Geiersbach, Michael Hintermüller, Thomas M. Surowiec

    We consider a risk-averse optimal control problem governed by an elliptic variational inequality (VI) subject to random inputs. By deriving KKT-type optimality conditions for a penalised and smoothed problem and studying convergence of the stationary points with respect to the penalisation parameter, we obtain two forms of stationarity conditions. The lack of regularity with respect to the uncertain parameters and complexities induced by the presence of the risk measure give rise to new challenges unique to the stochastic setting. We also propose a path-following stochastic approximation algorithm using variance reduction techniques and demonstrate the algorithm on a modified benchmark problem.


  • The latent variable proximal point algorithm for variational problems with inequality constraints

    by Jørgen S. Dokken, Patrick E. Farrell, Brendan Keith, Ioannis P.A. Papadopoulos, Thomas M. Surowiec


  • Open Access

    Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

    by Brendan Keith, Thomas M. Surowiec

    The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation ; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.


  • Asymptotic Consistency for Nonconvex Risk-Averse Stochastic Optimization with Infinite-Dimensional Decision Spaces

    by Johannes Milz, Thomas M. Surowiec

    Optimal values and solutions of empirical approximations of stochastic optimization problems can be viewed as statistical estimators of their true values. From this perspective, it is important to understand the asymptotic behavior of these estimators as the sample size goes to infinity. This area of study has a long tradition in stochastic programming. However, the literature is lacking consistency analysis for problems in which the decision variables are taken from an infinite-dimensional space, which arise in optimal control, scientific machine learning, and statistical estimation. By exploiting the typical problem structures found in these applications that give rise to hidden norm compactness properties for solution sets, we prove consistency results for nonconvex risk-averse stochastic optimization problems formulated in infinite-dimensional space. The proof is based on several crucial results from the theory of variational convergence. The theoretical results are demonstrated for several important problem classes arising in the literature.


  • On Binary Optimal Control in H s (0,T), s<1/2

    by Paul Manns, Thomas M. Surowiec

    The function space H s (0,T), s<1/2, allows for functions with jump discontinuities and is thus attractive for treating optimal control problems with discrete-valued control functions. We show that while arbitrary chattering controls are impossible, there exist feasible controls in H s (0,T) that have countably jump discontinuities with jump height one in each of countably many pairwise disjoint intervals. However, under mild assumptions, we show that certain types of jump discontinuities cannot be optimal. The derivation of meaningful optimality conditions via a direct variational argument using simple feasible perturbations remains a major challenge; as illustrated by an example.


  • Open Access

    A Risk Management Perspective on Statistical Estimation and Generalized Variational Inference

    by Aurya S. Javeed, Drew P. Kouri, Thomas M. Surowiec

    Generalized variational inference (GVI) provides an optimization-theoretic framework for statistical estimation that encapsulates many traditional estimation procedures. The typical GVI problem is to compute a distribution of parameters that maximizes the expected payoff minus the divergence of the distribution from a specified prior. In this way, GVI enables likelihood-free estimation with the ability to control the influence of the prior by tuning the so-called learning rate. Recently, GVI was shown to outperform traditional Bayesian inference when the model and prior distribution are misspecified. In this paper, we introduce and analyze a new GVI formulation based on utility theory and risk management. Our formulation is to maximize the expected payoff while enforcing constraints on the maximizing distribution. We recover the original GVI distribution by choosing the feasible set to include a constraint on the divergence of the distribution from the prior. In doing so, we automatically determine the learning rate as the Lagrange multiplier for the constraint. In this setting, we are able to transform the infinite-dimensional estimation problem into a two-dimensional convex program. This reformulation further provides an analytic expression for the optimal density of parameters. In addition, we prove asymptotic consistency results for empirical approximations of our optimal distributions. Throughout, we draw connections between our estimation procedure and risk management. In fact, we demonstrate that our estimation procedure is equivalent to evaluating a risk measure. We test our procedure on an estimation problem with a misspecified model and prior distribution, and conclude with some extensions of our approach.

  • Optimal Control of the Landau–de Gennes Model of Nematic Liquid Crystals

    by Thomas M. Surowiec, Shawn W. Walker

    We present an analysis and numerical study of an optimal control problem for the Landau–de Gennes (LdG) model of nematic liquid crystals (LCs), which is a crucial component in modern technology. They exhibit long range orientational order in their nematic phase, which is represented by a tensor-valued (spatial) order parameter [Formula: see text]. Equilibrium LC states correspond to [Formula: see text] functions that (locally) minimize an LdG energy functional. Thus, we consider an [Formula: see text]-gradient flow of the LdG energy that allows for finding local minimizers and leads to a semilinear parabolic PDE, for which we develop an optimal control framework. We then derive several a priori estimates for the forward problem, including continuity in space-time, that allow us to prove existence of optimal boundary and external “force” controls and to derive optimality conditions through the use of an adjoint equation. Next, we present a simple finite element scheme for the LdG model and a straightforward optimization algorithm. We illustrate optimization of LC states through numerical experiments in two and three dimensions that seek to place LC defects (where [Formula: see text]) in desired locations, which is desirable in applications.