Parameterized Complexity Analysis of Randomized Search Heuristics

This chapter compiles a number of results that apply the theory of parameterized algorithmics to the running-time analysis of randomized search heuristics such as evolutionary algorithms. The parameterized approach articulates the running time of algorithms solving combinatorial problems in finer detail than traditional approaches from classical complexity theory. We outline the main results and proof techniques for a collection of randomized search heuristics tasked to solve NP-hard combinatorial optimization problems such as finding a minimum vertex cover in a graph, finding a maximum leaf spanning tree in a graph, and the traveling salesperson problem.Comment: This is a preliminary version of a chapter in the book "Theory of Evolutionary Computation: Recent Developments in Discrete Optimization", edited by Benjamin Doerr and Frank Neumann, published by Springe

Streaming beyond sketching for Maximum Directed Cut

We give an $\widetilde{O}(\sqrt{n})$-space single-pass $0.483$-approximation streaming algorithm for estimating the maximum directed cut size ($\textsf{Max-DICUT}$) in a directed graph on $n$ vertices. This improves over an $O(\log n)$-space $4/9 < 0.45$ approximation algorithm due to Chou, Golovnev, Velusamy (FOCS 2020), which was known to be optimal for $o(\sqrt{n})$-space algorithms. $\textsf{Max-DICUT}$ is a special case of a constraint satisfaction problem (CSP). In this broader context, our work gives the first CSP for which algorithms with $\widetilde{O}(\sqrt{n})$ space can provably outperform $o(\sqrt{n})$-space algorithms on general instances. Previously, this was shown in the restricted case of bounded-degree graphs in a previous work of the authors (SODA 2023). Prior to that work, the only algorithms for any CSP were based on generalizations of the $O(\log n)$-space algorithm for $\textsf{Max-DICUT}$, and were in particular so-called "sketching" algorithms. In this work, we demonstrate that more sophisticated streaming algorithms can outperform these algorithms even on general instances. Our algorithm constructs a "snapshot" of the graph and then applies a result of Feige and Jozeph (Algorithmica, 2015) to approximately estimate the $\textsf{Max-DICUT}$ value from this snapshot. Constructing this snapshot is easy for bounded-degree graphs and the main contribution of our work is to construct this snapshot in the general setting. This involves some delicate sampling methods as well as a host of "continuity" results on the $\textsf{Max-DICUT}$ behaviour in graphs.Comment: 57 pages, 2 figure

Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization

We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order methods: (1) they allow using two different extrapolation points to evaluate the gradients and to add the inertial force (we will empirically show that it is more efficient than using a single extrapolation point), (2) they allow to randomly picking the block of variables to update, and (3) they do not require a restarting step. We prove the subsequential convergence of the generated sequence under mild assumptions, prove the global convergence under some additional assumptions, and provide convergence rates. We deploy the proposed methods to solve non-negative matrix factorization (NMF) and show that they compete favorably with the state-of-the-art NMF algorithms. Additional experiments on non-negative approximate canonical polyadic decomposition, also known as non-negative tensor factorization, are also provided

Methylation, Lifestyle and Genes in the Pathogenesis and Prevention of Human Congenital Heart Diseases

Up until now, only approximately 15% of the CHD can be attributed to a known cause. The remaining 85% is thought to result from interactions between genetic predispositions and periconception environmental exposures. Folate, a B vitamin involved i

Advances in state estimation, diagnosis and control of complex systems

This dissertation intends to provide theoretical and practical contributions on estimation, diagnosis and control of complex systems, especially in the mathematical form of descriptor systems. The research is motivated by real applications, such as water networks and power systems, which require a control system to provide a proper management able to take into account their specific features and operating limits in presence of uncertainties related to their operation and failures from component malfunctions. Such a control system is expected to provide an optimal operation to obtain efficient and reliable performance. State estimation is an essential tool, which can be used not only for fault diagnosis but also for the controller design. To achieve a satisfactory robust performance, set theory is chosen to build a general framework for descriptor systems subject to uncertainties. Under certain assumptions, these uncertainties are propagated and bounded by deterministic sets that can be explicitly characterized at each iteration step. Moreover, set-invariance characterizations for descriptor systems are also of interest to describe the steady performance, which can also be used for active mode detection. For the controller design for complex systems, new developments of economic model predictive control (EMPC) are studied taking into account the case of underlying periodic behaviors. The EMPC controller is designed to be recursively feasible even with sudden changes in the economic cost function and the closed-loop convergence is guaranteed. Besides, a robust technique is plugged into the EMPC controller design to maintain these closed-loop properties in presence of uncertainties. Engineering applications modeled as descriptor systems are presented to illustrate these control strategies. From the real applications, some additional difficulties are solved, such as using a two-layer control strategy to avoid binary variables in real-time optimizations and using nonlinear constraint relaxation to deal with nonlinear algebraic equations in the descriptor model. Furthermore, the fault-tolerant capability is also included in the controller design for descriptor systems by means of the designed virtual actuator and virtual sensor together with an observer-based delayed controller.Esta tesis propone contribuciones de carácter teórico y aplicado para la estimación del estado, el diagnóstico y el control óptimo de sistemas dinámicos complejos en particular, para los sistemas descriptores, incluyendo la capacidad de tolerancia a fallos. La motivación de la tesis proviene de aplicaciones reales, como redes de agua y sistemas de energía, cuya naturaleza crítica requiere necesariamente un sistema de control para una gestión capaz de tener en cuenta sus características específicas y límites operativos en presencia de incertidumbres relacionadas con su funcionamiento, así como fallos de funcionamiento de los componentes. El objetivo es conseguir controladores que mejoren tanto la eficiencia como la fiabilidad de dichos sistemas. La estimación del estado es una herramienta esencial que puede usarse no solo para el diagnóstico de fallos sino también para el diseño del control. Con este fin, se ha decidido utilizar metodologías intervalares, o basadas en conjuntos, para construir un marco general para los sistemas de descriptores sujetos a incertidumbres desconocidas pero acotadas. Estas incertidumbres se propagan y delimitan mediante conjuntos que se pueden caracterizar explícitamente en cada instante. Por otra parte, también se proponen caracterizaciones basadas en conjuntos invariantes para sistemas de descriptores que permiten describir comportamientos estacionarios y resultan útiles para la detección de modos activos. Se estudian también nuevos desarrollos del control predictivo económico basado en modelos (EMPC) para tener en cuenta posibles comportamientos periódicos en la variación de parámetros o en las perturbaciones que afectan a estos sistemas. Además, se demuestra que el control EMPC propuesto garantiza la factibilidad recursiva, incluso frente a cambios repentinos en la función de coste económico y se garantiza la convergencia en lazo cerrado. Por otra parte, se utilizan técnicas de control robusto pata garantizar que las estrategias de control predictivo económico mantengan las prestaciones en lazo cerrado, incluso en presencia de incertidumbre. Los desarrollos de la tesis se ilustran con casos de estudio realistas. Para algunas de aplicaciones reales, se resuelven dificultades adicionales, como el uso de una estrategia de control de dos niveles para evitar incluir variables binarias en la optimización y el uso de la relajación de restricciones no lineales para tratar las ecuaciones algebraicas no lineales en el modelo descriptor en las redes de agua. Finalmente, se incluye también una contribución al diseño de estrategias de control con tolerancia a fallos para sistemas descriptores

International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book

The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions. This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more

Structured Learning with Parsimony in Measurements and Computations: Theory, Algorithms, and Applications

University of Minnesota Ph.D. dissertation. July 2018. Major: Electrical Engineering. Advisor: Jarvis Haupt. 1 computer file (PDF); xvi, 289 pages.In modern ``Big Data'' applications, structured learning is the most widely employed methodology. Within this paradigm, the fundamental challenge lies in developing practical, effective algorithmic inference methods. Often (e.g., deep learning) successful heuristic-based approaches exist but theoretical studies are far behind, limiting understanding and potential improvements. In other settings (e.g., recommender systems) provably effective algorithmic methods exist, but the sheer sizes of datasets can limit their applicability. This twofold challenge motivates this work on developing new analytical and algorithmic methods for structured learning, with a particular focus on parsimony in measurements and computation, i.e., those requiring low storage and computational costs. Toward this end, we make efforts to investigate the theoretical properties of models and algorithms that present significant improvement in measurement and computation requirement. In particular, we first develop randomized approaches for dimensionality reduction on matrix and tensor data, which allow accurate estimation and inference procedures using significantly smaller data sizes that only depend on the intrinsic dimension (e.g., the rank of matrix/tensor) rather than the ambient ones. Our next effort is to study iterative algorithms for solving high dimensional learning problems, including both convex and nonconvex optimization. Using contemporary analysis techniques, we demonstrate guarantees of iteration complexities that are analogous to the low dimensional cases. In addition, we explore the landscape of nonconvex optimizations that exhibit computational advantages over their convex counterparts and characterize their properties from a general point of view in theory