@phdthesis{11932, abstract = {The ability to form and retrieve memories is central to survival. In mammals, the hippocampus is a brain region essential to the acquisition and consolidation of new memories. It is also involved in keeping track of one’s position in space and aids navigation. Although this space-memory has been a source of contradiction, evidence supports the view that the role of the hippocampus in navigation is memory, thanks to the formation of cognitive maps. First introduced by Tolman in 1948, cognitive maps are generally used to organize experiences in memory; however, the detailed mechanisms by which these maps are formed and stored are not yet agreed upon. Some influential theories describe this process as involving three fundamental steps: initial encoding by the hippocampus, interactions between the hippocampus and other cortical areas, and long-term extra-hippocampal consolidation. In this thesis, I will show how the investigation of cognitive maps of space helped to shed light on each of these three memory processes. The first study included in this thesis deals with the initial encoding of spatial memories in the hippocampus. Much is known about encoding at the level of single cells, but less about their co-activity or joint contribution to the encoding of novel spatial information. I will describe the structure of an interaction network that allows for efficient encoding of noisy spatial information during the first exploration of a novel environment. The second study describes the interactions between the hippocampus and the prefrontal cortex (PFC), two areas directly and indirectly connected. It is known that the PFC, in concert with the hippocampus, is involved in various processes, including memory storage and spatial navigation. Nonetheless, the detailed mechanisms by which PFC receives information from the hippocampus are not clear. I will show how a transient improvement in theta phase locking of PFC cells enables interactions of cell pairs across the two regions. The third study describes the learning of behaviorally-relevant spatial locations in the hippocampus and the medial entorhinal cortex. I will show how the accumulation of firing around goal locations, a correlate of learning, can shed light on the transition from short- to long-term spatial memories and the speed of consolidation in different brain areas. The studies included in this thesis represent the main scientific contributions of my Ph.D. They involve statistical analyses and models of neural responses of cells in different brain areas of rats executing spatial tasks. I will conclude the thesis by discussing the impact of the findings on principles of memory formation and retention, including the mechanisms, the speed, and the duration of these processes.}, author = {Nardin, Michele}, issn = {2663-337X}, pages = {136}, publisher = {Institute of Science and Technology Austria}, title = {{On the encoding, transfer, and consolidation of spatial memories}}, doi = {10.15479/at:ista:11932}, year = {2022}, } @phdthesis{11945, abstract = {G protein-coupled receptors (GPCRs) respond to specific ligands and regulate multiple processes ranging from cell growth and immune responses to neuronal signal transmission. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additional challenges exist to dissect cell-type specific responses when the same GPCR is expressed on several cell types within the body. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic a GPCR-of-interest in a desired cell type. We validated our approach with β2-adrenergic receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable responses on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Since β2AR is also enriched in microglia, which can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR in primary microglia and successfully recapitulate β2AR-mediated filopodia formation through CNO stimulation. To dissect the role of selected GPCRs during microglial inflammation, we additionally generated DREADD-based chimeras for microglia-enriched GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65 both modulated the inflammatory response with a similar profile as endogenously expressed β2AR, while DREADD-GPR109A showed no impact. Our DREADD-based approach provides the means to obtain mechanistic and functional insights into GPCR signaling on a cell-type specific level.}, author = {Schulz, Rouven}, issn = {2663-337X}, pages = {133}, publisher = {Institute of Science and Technology Austria}, title = {{Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function}}, doi = {10.15479/at:ista:11945}, year = {2022}, } @phdthesis{12072, abstract = {In this thesis, we study two of the most important questions in Arithmetic geometry: that of the existence and density of solutions to Diophantine equations. In order for a Diophantine equation to have any solutions over the rational numbers, it must have solutions everywhere locally, i.e., over R and over Qp for every prime p. The converse, called the Hasse principle, is known to fail in general. However, it is still a central question in Arithmetic geometry to determine for which varieties the Hasse principle does hold. In this work, we establish the Hasse principle for a wide new family of varieties of the form f(t) = NK/Q(x) ̸= 0, where f is a polynomial with integer coefficients and NK/Q denotes the norm form associated to a number field K. Our results cover products of arbitrarily many linear, quadratic or cubic factors, and generalise an argument of Irving [69], which makes use of the beta sieve of Rosser and Iwaniec. We also demonstrate how our main sieve results can be applied to treat new cases of a conjecture of Harpaz and Wittenberg on locally split values of polynomials over number fields, and discuss consequences for rational points in fibrations. In the second question, about the density of solutions, one defines a height function and seeks to estimate asymptotically the number of points of height bounded by B as B → ∞. Traditionally, one either counts rational points, or integral points with respect to a suitable model. However, in this thesis, we study an emerging area of interest in Arithmetic geometry known as Campana points, which in some sense interpolate between rational and integral points. More precisely, we count the number of nonzero integers z1, z2, z3 such that gcd(z1, z2, z3) = 1, and z1, z2, z3, z1 + z2 + z3 are all squareful and bounded by B. Using the circle method, we obtain an asymptotic formula which agrees in the power of B and log B with a bold new generalisation of Manin’s conjecture to the setting of Campana points, recently formulated by Pieropan, Smeets, Tanimoto and Várilly-Alvarado [96]. However, in this thesis we also provide the first known counterexamples to leading constant predicted by their conjecture. }, author = {Shute, Alec L}, isbn = {978-3-99078-023-7}, issn = {2663-337X}, pages = {208}, publisher = {Institute of Science and Technology Austria}, title = {{Existence and density problems in Diophantine geometry: From norm forms to Campana points}}, doi = {10.15479/at:ista:12072}, year = {2022}, } @inproceedings{12102, abstract = {Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset.}, author = {Ahmadi, Ali and Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Meggendorfer, Tobias and Safavi Hemami, Roodabeh and Zikelic, Dorde}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, isbn = {9783959772617}, issn = {1868-8969}, location = {Madras, India}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Algorithms and hardness results for computing cores of Markov chains}}, doi = {10.4230/LIPIcs.FSTTCS.2022.29}, volume = {250}, year = {2022}, } @article{12117, abstract = {To understand how potential gene manipulations affect in vitro microglia, we provide a set of short protocols to evaluate microglia identity and function. We detail steps for immunostaining to determine microglia identity. We describe three functional assays for microglia: phagocytosis, calcium response following ATP stimulation, and cytokine expression upon inflammatory stimuli. We apply these protocols to human induced-pluripotent-stem-cell (hiPSC)-derived microglia, but they can be also applied to other in vitro microglial models including primary mouse microglia. For complete details on the use and execution of this protocol, please refer to Bartalska et al. (2022).1}, author = {Hübschmann, Verena and Korkut, Medina and Siegert, Sandra}, issn = {2666-1667}, journal = {STAR Protocols}, keywords = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Neuroscience}, number = {4}, publisher = {Elsevier}, title = {{Assessing human iPSC-derived microglia identity and function by immunostaining, phagocytosis, calcium activity, and inflammation assay}}, doi = {10.1016/j.xpro.2022.101866}, volume = {3}, year = {2022}, } @article{12291, abstract = {The phytohormone auxin triggers transcriptional reprogramming through a well-characterized perception machinery in the nucleus. By contrast, mechanisms that underlie fast effects of auxin, such as the regulation of ion fluxes, rapid phosphorylation of proteins or auxin feedback on its transport, remain unclear1,2,3. Whether auxin-binding protein 1 (ABP1) is an auxin receptor has been a source of debate for decades1,4. Here we show that a fraction of Arabidopsis thaliana ABP1 is secreted and binds auxin specifically at an acidic pH that is typical of the apoplast. ABP1 and its plasma-membrane-localized partner, transmembrane kinase 1 (TMK1), are required for the auxin-induced ultrafast global phospho-response and for downstream processes that include the activation of H+-ATPase and accelerated cytoplasmic streaming. abp1 and tmk mutants cannot establish auxin-transporting channels and show defective auxin-induced vasculature formation and regeneration. An ABP1(M2X) variant that lacks the capacity to bind auxin is unable to complement these defects in abp1 mutants. These data indicate that ABP1 is the auxin receptor for TMK1-based cell-surface signalling, which mediates the global phospho-response and auxin canalization.}, author = {Friml, Jiří and Gallei, Michelle C and Gelová, Zuzana and Johnson, Alexander J and Mazur, Ewa and Monzer, Aline and Rodriguez Solovey, Lesia and Roosjen, Mark and Verstraeten, Inge and Živanović, Branka D. and Zou, Minxia and Fiedler, Lukas and Giannini, Caterina and Grones, Peter and Hrtyan, Mónika and Kaufmann, Walter and Kuhn, Andre and Narasimhan, Madhumitha and Randuch, Marek and Rýdza, Nikola and Takahashi, Koji and Tan, Shutang and Teplova, Anastasiia and Kinoshita, Toshinori and Weijers, Dolf and Rakusová, Hana}, issn = {1476-4687}, journal = {Nature}, number = {7927}, pages = {575--581}, publisher = {Springer Nature}, title = {{ABP1–TMK auxin perception for global phosphorylation and auxin canalization}}, doi = {10.1038/s41586-022-05187-x}, volume = {609}, year = {2022}, } @article{12307, abstract = {Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences.}, author = {Shipman, Barbara A. and Stephenson, Elizabeth R}, issn = {1935-4053}, journal = {PRIMUS}, keywords = {Education, General Mathematics}, number = {5}, pages = {593--609}, publisher = {Taylor & Francis}, title = {{Tangible topology through the lens of limits}}, doi = {10.1080/10511970.2021.1872750}, volume = {32}, year = {2022}, } @phdthesis{12358, abstract = {The complex yarn structure of knitted and woven fabrics gives rise to both a mechanical and visual complexity. The small-scale interactions of yarns colliding with and pulling on each other result in drastically different large-scale stretching and bending behavior, introducing anisotropy, curling, and more. While simulating cloth as individual yarns can reproduce this complexity and match the quality of real fabric, it may be too computationally expensive for large fabrics. On the other hand, continuum-based approaches do not need to discretize the cloth at a stitch-level, but it is non-trivial to find a material model that would replicate the large-scale behavior of yarn fabrics, and they discard the intricate visual detail. In this thesis, we discuss three methods to try and bridge the gap between small-scale and large-scale yarn mechanics using numerical homogenization: fitting a continuum model to periodic yarn simulations, adding mechanics-aware yarn detail onto thin-shell simulations, and quantitatively fitting yarn parameters to physical measurements of real fabric. To start, we present a method for animating yarn-level cloth effects using a thin-shell solver. We first use a large number of periodic yarn-level simulations to build a model of the potential energy density of the cloth, and then use it to compute forces in a thin-shell simulator. The resulting simulations faithfully reproduce expected effects like the stiffening of woven fabrics and the highly deformable nature and anisotropy of knitted fabrics at a fraction of the cost of full yarn-level simulation. While our thin-shell simulations are able to capture large-scale yarn mechanics, they lack the rich visual detail of yarn-level simulations. Therefore, we propose a method to animate yarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware fashion in real time. Using triangle strains to interpolate precomputed yarn geometry, we are able to reproduce effects such as knit loops tightening under stretching at negligible cost. Finally, we introduce a methodology for inverse-modeling of yarn-level mechanics of cloth, based on the mechanical response of fabrics in the real world. We compile a database from physical tests of several knitted fabrics used in the textile industry spanning diverse physical properties like stiffness, nonlinearity, and anisotropy. We then develop a system for approximating these mechanical responses with yarn-level cloth simulation, using homogenized shell models to speed up computation and adding some small-but-necessary extensions to yarn-level models used in computer graphics. }, author = {Sperl, Georg}, isbn = {978-3-99078-020-6}, issn = {2663-337X}, pages = {138}, publisher = {Institute of Science and Technology Austria}, title = {{Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting}}, doi = {10.15479/at:ista:12103}, year = {2022}, } @phdthesis{12364, abstract = {Autism spectrum disorders (ASDs) are a group of neurodevelopmental disorders characterized by behavioral symptoms such as problems in social communication and interaction, as well as repetitive, restricted behaviors and interests. These disorders show a high degree of heritability and hundreds of risk genes have been identifed using high throughput sequencing technologies. This genetic heterogeneity has hampered eforts in understanding the pathogenesis of ASD but at the same time given rise to the concept of convergent mechanisms. Previous studies have identifed that risk genes for ASD broadly converge onto specifc functional categories with transcriptional regulation being one of the biggest groups. In this thesis, I focus on this subgroup of genes and investigate the gene regulatory consequences of some of them in the context of neurodevelopment. First, we showed that mutations in the ASD and intellectual disability risk gene Setd5 lead to perturbations of gene regulatory programs in early cell fate specifcation. In addition, adult animals display abnormal learning behavior which is mirrored at the transcriptional level by altered activity dependent regulation of postsynaptic gene expression. Lastly, we link the regulatory function of Setd5 to its interaction with the Paf1 and the NCoR complex. Second, by modeling the heterozygous loss of the top ASD gene CHD8 in human cerebral organoids we demonstrate profound changes in the developmental trajectories of both inhibitory and excitatory neurons using single cell RNA-sequencing. While the former were generated earlier in CHD8+/- organoids, the generation of the latter was shifted to later times in favor of a prolonged progenitor expansion phase and ultimately increased organoid size. Finally, by modeling heterozygous mutations for four ASD associated chromatin modifers, ASH1L, KDM6B, KMT5B, and SETD5 in human cortical spheroids we show evidence of regulatory convergence across three of those genes. We observe a shift from dorsal cortical excitatory neuron fates towards partially ventralized cell types resembling cells from the lateral ganglionic eminence. As this project is still ongoing at the time of writing, future experiments will aim at elucidating the regulatory mechanisms underlying this shift with the aim of linking these three ASD risk genes through biological convergence.}, author = {Dotter, Christoph}, issn = {2663-337X}, pages = {152}, publisher = {Institute of Science and Technology Austria}, title = {{Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder}}, doi = {10.15479/at:ista:12094}, year = {2022}, } @phdthesis{12366, abstract = {Recent substantial advances in the feld of superconducting circuits have shown its potential as a leading platform for future quantum computing. In contrast to classical computers based on bits that are represented by a single binary value, 0 or 1, quantum bits (or qubits) can be in a superposition of both. Thus, quantum computers can store and handle more information at the same time and a quantum advantage has already been demonstrated for two types of computational tasks. Rapid progress in academic and industry labs accelerates the development of superconducting processors which may soon fnd applications in complex computations, chemical simulations, cryptography, and optimization. Now that these machines are scaled up to tackle such problems the questions of qubit interconnects and networks becomes very relevant. How to route signals on-chip between diferent processor components? What is the most efcient way to entangle qubits? And how to then send and process entangled signals between distant cryostats hosting superconducting processors? In this thesis, we are looking for solutions to these problems by studying the collective behavior of superconducting qubit ensembles. We frst demonstrate on-demand tunable directional scattering of microwave photons from a pair of qubits in a waveguide. Such a device can route microwave photons on-chip with a high diode efciency. Then we focus on studying ultra-strong coupling regimes between light (microwave photons) and matter (superconducting qubits), a regime that could be promising for extremely fast multi-qubit entanglement generation. Finally, we show coherent pulse storage and periodic revivals in a fve qubit ensemble strongly coupled to a resonator. Such a reconfgurable storage device could be used as part of a quantum repeater that is needed for longer-distance quantum communication. The achieved high degree of control over multi-qubit ensembles highlights not only the beautiful physics of circuit quantum electrodynamics, it also represents the frst step toward new quantum simulation and communication methods, and certain techniques may also fnd applications in future superconducting quantum computing hardware. }, author = {Redchenko, Elena}, isbn = {978-3-99078-024-4}, issn = {2663-337X}, pages = {168}, publisher = {Institute of Science and Technology Austria}, title = {{Controllable states of superconducting Qubit ensembles}}, doi = {10.15479/at:ista:12132}, year = {2022}, } @phdthesis{12368, abstract = {Metazoan development relies on the formation and remodeling of cell-cell contacts. The binding of adhesion receptors and remodeling of the actomyosin cell cortex at cell-cell interaction sites have been implicated in cell-cell contact formation. Yet, how these two processes functionally interact to drive cell-cell contact expansion and strengthening remains unclear. Here, we study how primary germ layer progenitor cells from zebrafish bind to supported lipid bilayers (SLB) functionalized with E-cadherin ectodomains as an assay system for monitoring cell-cell contact formation at high spatiotemporal resolution. We show that cell-cell contact formation represents a two-tiered process: E-cadherinmediated downregulation of the small GTPase RhoA at the forming contact leads to both depletion of Myosin-2 and decrease of F-actin. This is followed by centrifugal actin network flows at the contact triggered by a sharp gradient of Myosin-2 at the rim of the contact zone, with Myosin-2 displaying higher cortical localization outside than inside of the contact. These centrifugal cortical actin flows, in turn, not only further dilute the actin network at the contact disc, but also lead to an accumulation of both F-actin and Ecadherin at the contact rim. Eventually, this combination of actomyosin downregulation and flows at the contact contribute to the characteristic molecular organization implicated in contact formation and maintenance: depletion of cortical actomyosin at the contact disc, driving contact expansion by lowering interfacial tension at the contact, and accumulation of both E-cadherin and F-actin at the contact rim, mechanically linking the contractile cortices of the adhering cells. Thus, using a biomimetic assay, we exemplify how adhesion signaling and cell mechanics function together to modulate the spatial organization of cell-cell contacts.}, author = {Arslan, Feyza N}, isbn = { 978-3-99078-025-1 }, issn = {2663-337X}, pages = {113}, publisher = {Institute of Science and Technology Austria}, title = {{Remodeling of E-cadherin-mediated contacts via cortical flows}}, doi = {10.15479/at:ista:12153}, year = {2022}, } @phdthesis{12378, abstract = {Environmental cues influence the highly dynamic morphology of microglia. Strategies to characterize these changes usually involve user-selected morphometric features, which preclude the identification of a spectrum of context-dependent morphological phenotypes. Here, we develop MorphOMICs, a topological data analysis approach, which enables semiautomatic mapping of microglial morphology into an atlas of cue-dependent phenotypes, overcomes feature-selection bias and minimizes biological variability. First, with MorphOMICs we derive the morphological spectrum of microglia across seven brain regions during postnatal development and in two distinct Alzheimer’s disease degeneration mouse models. We uncover region-specific and sexually dimorphic morphological trajectories, with females showing an earlier morphological shift than males in the degenerating brain. Overall, we demonstrate that both long primary- and short terminal processes provide distinct insights to morphological phenotypes. Moreover, using machine learning to map novel condition on the spectrum, we observe that microglia morphologies reflect a dose-dependent adaptation upon ketamine anesthesia and do not recover to control morphologies. Next, we took advantage of MorphOMICs to build a high-resolution and layer-specific map of microglial morphological spectrum in the retina, covering postnatal development and rd10 degeneration. Here, following photoreceptor death, microglia assume an early developmentlike morphology. Finally, we map microglial morphology following optic nerve crush on the retinal spectrum and observe a layer- and sex-dependent response. Overall, MorphOMICs opens a new perspective to analyze microglial morphology across multiple conditions, and provides a novel tool to characterize microglial morphology beyond the traditionally dichotomized view of microglia.}, author = {Colombo, Gloria}, issn = {2663-337X}, pages = {142}, publisher = {Institute of Science and Technology Austria}, title = {{MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes}}, doi = {10.15479/at:ista:12378}, year = {2022}, } @phdthesis{12390, abstract = {The scope of this thesis is to study quantum systems exhibiting a continuous symmetry that is broken on the level of the corresponding effective theory. In particular we are going to investigate translation-invariant Bose gases in the mean field limit, effectively described by the Hartree functional, and the Fröhlich Polaron in the regime of strong coupling, effectively described by the Pekar functional. The latter is a model describing the interaction between a charged particle and the optical modes of a polar crystal. Regarding the former, we assume in addition that the particles in the gas are unconfined, and typically we will consider particles that are subject to an attractive interaction. In both cases the ground state energy of the Hamiltonian is not a proper eigenvalue due to the underlying translation-invariance, while on the contrary there exists a whole invariant orbit of minimizers for the corresponding effective functionals. Both, the absence of proper eigenstates and the broken symmetry of the effective theory, make the study significantly more involved and it is the content of this thesis to develop a frameworks which allows for a systematic way to circumvent these issues. It is a well-established result that the ground state energy of Bose gases in the mean field limit, as well as the ground state energy of the Fröhlich Polaron in the regime of strong coupling, is to leading order given by the minimal energy of the corresponding effective theory. As part of this thesis we identify the sub-leading term in the expansion of the ground state energy, which can be interpreted as the quantum correction to the classical energy, since the effective theories under consideration can be seen as classical counterparts. We are further going to establish an asymptotic expression for the energy-momentum relation of the Fröhlich Polaron in the strong coupling limit. In the regime of suitably small momenta, this asymptotic expression agrees with the energy-momentum relation of a free particle having an effectively increased mass, and we find that this effectively increased mass agrees with the conjectured value in the physics literature. In addition we will discuss two unrelated papers written by the author during his stay at ISTA in the appendix. The first one concerns the realization of anyons, which are quasi-particles acquiring a non-trivial phase under the exchange of two particles, as molecular impurities. The second one provides a classification of those vector fields defined on a given manifold that can be written as the gradient of a given functional with respect to a suitable metric, provided that some mild smoothness assumptions hold. This classification is subsequently used to identify those quantum Markov semigroups that can be written as a gradient flow of the relative entropy. }, author = {Brooks, Morris}, issn = {2663-337X}, pages = {196}, publisher = {Institute of Science and Technology Austria}, title = {{Translation-invariant quantum systems with effectively broken symmetry}}, doi = {10.15479/at:ista:12390}, year = {2022}, } @phdthesis{12401, abstract = {Detachment of the cancer cells from the bulk of the tumor is the first step of metastasis, which is the primary cause of cancer related deaths. It is unclear, which factors contribute to this step. Recent studies indicate a crucial role of the tumor microenvironment in malignant transformation and metastasis. Studying cancer cell invasion and detachments quantitatively in the context of its physiological microenvironment is technically challenging. Especially, precise control of microenvironmental properties in vivo is currently not possible. Here, I studied the role of microenvironment geometry in the invasion and detachment of cancer cells from the bulk with a simplistic and reductionist approach. In this approach, I engineered microfluidic devices to mimic a pseudo 3D extracellular matrix environment, where I was able to quantitatively tune the geometrical configuration of the microenvironment and follow tumor cells with fluorescence live imaging. To aid quantitative analysis I developed a widely applicable software application to automatically analyze and visualize particle tracking data. Quantitative analysis of tumor cell invasion in isotropic and anisotropic microenvironments showed that heterogeneity in the microenvironment promotes faster invasion and more frequent detachment of cells. These observations correlated with overall higher speed of cells at the edge of the bulk of the cells. In heterogeneous microenvironments cells preferentially passed through larger pores, thus invading areas of least resistance and generating finger-like invasive structures. The detachments occurred mostly at the tips of these structures. To investigate the potential mechanism, we established a two dimensional model to simulate active Brownian particles representing the cell nuclei dynamics. These simulations backed our in vitro observations without the need of precise fitting the simulation parameters. Our model suggests the importance of the pore heterogeneity in the direction perpendicular to the orientation of bias field (lateral heterogeneity), which causes the interface roughening.}, author = {Tasciyan, Saren}, issn = {2663-337X}, pages = {105}, publisher = {Institute of Science and Technology Austria}, title = {{Role of microenvironment heterogeneity in cancer cell invasion}}, doi = {10.15479/at:ista:12401}, year = {2022}, } @unpublished{12677, abstract = {In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process. We model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal.}, author = {Chatterjee, Krishnendu and Mohammadi, Mona and Saona Urmeneta, Raimundo J}, booktitle = {arXiv}, title = {{Repeated prophet inequality with near-optimal bounds}}, doi = {10.48550/ARXIV.2209.14368}, year = {2022}, } @unpublished{12750, abstract = {Quantum kinetically constrained models have recently attracted significant attention due to their anomalous dynamics and thermalization. In this work, we introduce a hitherto unexplored family of kinetically constrained models featuring a conserved particle number and strong inversion-symmetry breaking due to facilitated hopping. We demonstrate that these models provide a generic example of so-called quantum Hilbert space fragmentation, that is manifested in disconnected sectors in the Hilbert space that are not apparent in the computational basis. Quantum Hilbert space fragmentation leads to an exponential in system size number of eigenstates with exactly zero entanglement entropy across several bipartite cuts. These eigenstates can be probed dynamically using quenches from simple initial product states. In addition, we study the particle spreading under unitary dynamics launched from the domain wall state, and find faster than diffusive dynamics at high particle densities, that crosses over into logarithmically slow relaxation at smaller densities. Using a classically simulable cellular automaton, we reproduce the logarithmic dynamics observed in the quantum case. Our work suggests that particle conserving constrained models with inversion symmetry breaking realize so far unexplored universality classes of dynamics and invite their further theoretical and experimental studies.}, author = {Brighi, Pietro and Ljubotina, Marko and Serbyn, Maksym}, booktitle = {arXiv}, title = {{Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models}}, doi = {10.48550/arXiv.2210.15607}, year = {2022}, } @unpublished{12860, abstract = {Memorization of the relation between entities in a dataset can lead to privacy issues when using a trained model for question answering. We introduce Relational Memorization (RM) to understand, quantify and control this phenomenon. While bounding general memorization can have detrimental effects on the performance of a trained model, bounding RM does not prevent effective learning. The difference is most pronounced when the data distribution is long-tailed, with many queries having only few training examples: Impeding general memorization prevents effective learning, while impeding only relational memorization still allows learning general properties of the underlying concepts. We formalize the notion of Relational Privacy (RP) and, inspired by Differential Privacy (DP), we provide a possible definition of Differential Relational Privacy (DrP). These notions can be used to describe and compute bounds on the amount of RM in a trained model. We illustrate Relational Privacy concepts in experiments with large-scale models for Question Answering.}, author = {Bombari, Simone and Achille, Alessandro and Wang, Zijian and Wang, Yu-Xiang and Xie, Yusheng and Singh, Kunwar Yashraj and Appalaraju, Srikar and Mahadevan, Vijay and Soatto, Stefano}, booktitle = {arXiv}, title = {{Towards differential relational privacy and its use in question answering}}, doi = {10.48550/arXiv.2203.16701}, year = {2022}, } @inproceedings{10665, abstract = {Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors into account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.}, author = {Henzinger, Thomas A and Lechner, Mathias and Zikelic, Dorde}, booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence}, isbn = {978-1-57735-866-4}, issn = {2374-3468}, location = {Virtual}, number = {5A}, pages = {3787--3795}, publisher = {AAAI Press}, title = {{Scalable verification of quantized neural networks}}, volume = {35}, year = {2021}, } @inproceedings{10666, abstract = {Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.}, author = {Lechner, Mathias and Hasani, Ramin and Grosu, Radu and Rus, Daniela and Henzinger, Thomas A}, booktitle = {2021 IEEE International Conference on Robotics and Automation}, isbn = {978-1-7281-9078-5}, issn = {2577-087X}, location = {Xi'an, China}, pages = {4140--4147}, title = {{Adversarial training is not ready for robot learning}}, doi = {10.1109/ICRA48506.2021.9561036}, year = {2021}, } @inproceedings{10667, abstract = {Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.}, author = {Lechner, Mathias and Žikelić, Ðorđe and Chatterjee, Krishnendu and Henzinger, Thomas A}, booktitle = {35th Conference on Neural Information Processing Systems}, location = {Virtual}, title = {{Infinite time horizon safety of Bayesian neural networks}}, doi = {10.48550/arXiv.2111.03165}, year = {2021}, }