Related papers: The infinite Viterbi alignment and decay-convexity
We develop an exact coordinate descent algorithm for high-dimensional regularized Huber regression. In contrast to composite gradient descent methods, our algorithm fully exploits the advantages of coordinate descent when the underlying…
We study maximum-entropy inference for finite-dimensional quantum states under linear moment constraints. Given expectation values of finitely many observables, the feasible set of states is convex but typically non-unique. The…
In variational inference, the benefits of Bayesian models rely on accurately capturing the true posterior distribution. We propose using neural samplers that specify implicit distributions, which are well-suited for approximating complex…
The vertical alignment optimization problem in road design seeks the optimal vertical alignment of a road at minimal cost, taking into account earthwork while meeting all safety and design requirements. In recent years, modelling techniques…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
We initiate the study of the norm-squared of the momentum map as a rigorous tool in infinite dimensions. In particular, we calculate the Hessian at a critical point, show that it is positive semi-definite along the complexified orbit, and…
Many exact Markov chain Monte Carlo algorithms have been developed for posterior inference in Bayesian nonparametric models which involve infinite-dimensional priors. However, these methods are not generic and special methodology must be…
In this paper we study the bounded perturbation resilience of projection and contraction algorithms for solving variational inequality (VI) problems in real Hilbert spaces. Under typical and standard assumptions of monotonicity and…
Finite-dimensional state-space representations of unsteady aerodynamics implicitly assume a system with fading memory. However, the impulse response of the two-dimensional inviscid (Euler) equations is characterized by an asymptotic…
This paper develops new tools to quantify uncertainty in optimal decision making and to gain insight into which variables one should collect information about given the potential cost of measuring a large number of variables. We investigate…
We establish the optimal nonergodic sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. First, the optimal bound is formulated by the performance estimation framework, resulting in an infinite…
In this work the standard kinetic theory assumption of instantaneous collisions is lifted. As a continuation of of a previous paper by Kanzler, Schmeiser, and Tora [KRM, 2024], a model for higher order non-instantaneous alignment collisions…
We introduce an optimization model for maximum likelihood-type estimation (M-estimation) that generalizes a large class of existing statistical models, including Huber's concomitant M-estimator, Owen's Huber/Berhu concomitant estimator, the…
In the framework of inverse linear problems on infinite-dimensional Hilbert space, we prove the convergence of the conjugate gradient iterates to an exact solution to the inverse problem in the most general case where the self-adjoint,…
This survey collects, within a unified framework, various results (primarily by the authors themselves) on the use of Deterministic Infinite-Dimensional Optimal Control Theory to address applied economic models. The main aim is to…
We introduce an infinite-dimensional version of the Christoffel function, where now (i) its argument lies in a Hilbert space of functions, and (ii) its associated underlying measure is supported on a compact subset of the Hilbert space. We…
We study Bayesian inference of an unknown matching $\pi^*$ between two correlated random point sets $\{X_i\}_{i=1}^n$ and $\{Y_i\}_{i=1}^n$ in $[0,1]^d$, under a critical scaling $\|X_i-Y_{\pi^*(i)}\|_2 \asymp n^{-1/d}$, in both an exact…
Predicting future video frames is a challenging task with many downstream applications. Previous work has shown that procedural knowledge enables deep models for complex dynamical settings, however their model ViPro assumed a given ground…
Estimation of convex functions finds broad applications in engineering and science, while convex shape constraint gives rise to numerous challenges in asymptotic performance analysis. This paper is devoted to minimax optimal estimation of…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…