TY - JOUR AB - Regulation of chromatin states involves the dynamic interplay between different histone modifications to control gene expression. Recent advances have enabled mapping of histone marks in single cells, but most methods are constrained to profile only one histone mark per cell. Here, we present an integrated experimental and computational framework, scChIX-seq (single-cell chromatin immunocleavage and unmixing sequencing), to map several histone marks in single cells. scChIX-seq multiplexes two histone marks together in single cells, then computationally deconvolves the signal using training data from respective histone mark profiles. This framework learns the cell-type-specific correlation structure between histone marks, and therefore does not require a priori assumptions of their genomic distributions. Using scChIX-seq, we demonstrate multimodal analysis of histone marks in single cells across a range of mark combinations. Modeling dynamics of in vitro macrophage differentiation enables integrated analysis of chromatin velocity. Overall, scChIX-seq unlocks systematic interrogation of the interplay between histone modifications in single cells. AU - Yeung, Jake AU - Florescu, Maria AU - Zeller, Peter AU - De Barbanson, Buys Anton AU - Wellenstein, Max D. AU - Van Oudenaarden, Alexander ID - 12106 JF - Nature Biotechnology SN - 1087-0156 TI - scChIX-seq infers dynamic relationships between histone modifications in single cells VL - 41 ER - TY - JOUR AB - We consider a gas of n bosonic particles confined in a box [−ℓ/2,ℓ/2]3 with Neumann boundary conditions. We prove Bose–Einstein condensation in the Gross–Pitaevskii regime, with an optimal bound on the condensate depletion. Moreover, our lower bound for the ground state energy in a small box [−ℓ/2,ℓ/2]3 implies (via Neumann bracketing) a lower bound for the ground state energy of N bosons in a large box [−L/2,L/2]3 with density ρ=N/L3 in the thermodynamic limit. AU - Boccato, Chiara AU - Seiringer, Robert ID - 12183 JF - Annales Henri Poincare SN - 1424-0637 TI - The Bose Gas in a box with Neumann boundary conditions VL - 24 ER - TY - JOUR AB - Geometry is crucial in our efforts to comprehend the structures and dynamics of biomolecules. For example, volume, surface area, and integrated mean and Gaussian curvature of the union of balls representing a molecule are used to quantify its interactions with the water surrounding it in the morphometric implicit solvent models. The Alpha Shape theory provides an accurate and reliable method for computing these geometric measures. In this paper, we derive homogeneous formulas for the expressions of these measures and their derivatives with respect to the atomic coordinates, and we provide algorithms that implement them into a new software package, AlphaMol. The only variables in these formulas are the interatomic distances, making them insensitive to translations and rotations. AlphaMol includes a sequential algorithm and a parallel algorithm. In the parallel version, we partition the atoms of the molecule of interest into 3D rectangular blocks, using a kd-tree algorithm. We then apply the sequential algorithm of AlphaMol to each block, augmented by a buffer zone to account for atoms whose ball representations may partially cover the block. The current parallel version of AlphaMol leads to a 20-fold speed-up compared to an independent serial implementation when using 32 processors. For instance, it takes 31 s to compute the geometric measures and derivatives of each atom in a viral capsid with more than 26 million atoms on 32 Intel processors running at 2.7 GHz. The presence of the buffer zones, however, leads to redundant computations, which ultimately limit the impact of using multiple processors. AlphaMol is available as an OpenSource software. AU - Koehl, Patrice AU - Akopyan, Arseniy AU - Edelsbrunner, Herbert ID - 12544 IS - 3 JF - Journal of Chemical Information and Modeling SN - 1549-9596 TI - Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives VL - 63 ER - TY - JOUR AB - Treating sick group members is a hallmark of collective disease defence in vertebrates and invertebrates alike. Despite substantial effects on pathogen fitness and epidemiology, it is still largely unknown how pathogens react to the selection pressure imposed by care intervention. Using social insects and pathogenic fungi, we here performed a serial passage experiment in the presence or absence of colony members, which provide social immunity by grooming off infectious spores from exposed individuals. We found specific effects on pathogen diversity, virulence and transmission. Under selection of social immunity, pathogens invested into higher spore production, but spores were less virulent. Notably, they also elicited a lower grooming response in colony members, compared with spores from the individual host selection lines. Chemical spore analysis suggested that the spores from social selection lines escaped the caregivers’ detection by containing lower levels of ergosterol, a key fungal membrane component. Experimental application of chemically pure ergosterol indeed induced sanitary grooming, supporting its role as a microbe-associated cue triggering host social immunity against fungal pathogens. By reducing this detection cue, pathogens were able to evade the otherwise very effective collective disease defences of their social hosts. AU - Stock, Miriam AU - Milutinovic, Barbara AU - Hönigsberger, Michaela AU - Grasse, Anna V AU - Wiesenhofer, Florian AU - Kampleitner, Niklas AU - Narasimhan, Madhumitha AU - Schmitt, Thomas AU - Cremer, Sylvia ID - 12543 JF - Nature Ecology and Evolution TI - Pathogen evasion of social immunity VL - 7 ER - TY - JOUR AB - Differentiated X chromosomes are expected to have higher rates of adaptive divergence than autosomes, if new beneficial mutations are recessive (the “faster-X effect”), largely because these mutations are immediately exposed to selection in males. The evolution of X chromosomes after they stop recombining in males, but before they become hemizygous, has not been well explored theoretically. We use the diffusion approximation to infer substitution rates of beneficial and deleterious mutations under such a scenario. Our results show that selection is less efficient on diploid X loci than on autosomal and hemizygous X loci under a wide range of parameters. This “slower-X” effect is stronger for genes affecting primarily (or only) male fitness, and for sexually antagonistic genes. These unusual dynamics suggest that some of the peculiar features of X chromosomes, such as the differential accumulation of genes with sex-specific functions, may start arising earlier than previously appreciated. AU - Mrnjavac, Andrea AU - Khudiakova, Kseniia AU - Barton, Nicholas H AU - Vicoso, Beatriz ID - 12521 IS - 1 JF - Evolution Letters KW - Genetics KW - Ecology KW - Evolution KW - Behavior and Systematics SN - 2056-3744 TI - Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution VL - 7 ER - TY - JOUR AB - How to generate a brain of correct size and with appropriate cell-type diversity during development is a major question in Neuroscience. In the developing neocortex, radial glial progenitor (RGP) cells are the main neural stem cells that produce cortical excitatory projection neurons, glial cells, and establish the prospective postnatal stem cell niche in the lateral ventricles. RGPs follow a tightly orchestrated developmental program that when disrupted can result in severe cortical malformations such as microcephaly and megalencephaly. The precise cellular and molecular mechanisms instructing faithful RGP lineage progression are however not well understood. This review will summarize recent conceptual advances that contribute to our understanding of the general principles of RGP lineage progression. AU - Hippenmeyer, Simon ID - 12679 IS - 4 JF - Current Opinion in Neurobiology KW - General Neuroscience SN - 0959-4388 TI - Principles of neural stem cell lineage progression: Insights from developing cerebral cortex VL - 79 ER - TY - JOUR AB - In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown. AU - Agresti, Antonio AU - Lindemulder, Nick AU - Veraar, Mark ID - 12429 IS - 4 JF - Mathematische Nachrichten SN - 0025-584X TI - On the trace embedding and its applications to evolution equations VL - 296 ER - TY - JOUR AB - We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively. AU - Falconi, Marco AU - Leopold, Nikolai K AU - Mitrouskas, David Johannes AU - Petrat, Sören P ID - 12430 IS - 4 JF - Reviews in Mathematical Physics SN - 0129-055X TI - Bogoliubov dynamics and higher-order corrections for the regularized Nelson model VL - 35 ER - TY - JOUR AB - Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations. AU - Lombardi, Fabrizio AU - Pepic, Selver AU - Shriki, Oren AU - Tkačik, Gašper AU - De Martino, Daniele ID - 12762 JF - Nature Computational Science TI - Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain VL - 3 ER - TY - THES AB - The tight spatiotemporal coordination of signaling activity determining embryo patterning and the physical processes driving embryo morphogenesis renders embryonic development robust, such that key developmental processes can unfold relatively normally even outside of the full embryonic context. For instance, embryonic stem cell cultures can recapitulate the hallmarks of gastrulation, i.e. break symmetry leading to germ layer formation and morphogenesis, in a very reduced environment. This leads to questions on specific contributions of embryo-specific features, such as the presence of extraembryonic tissues, which are inherently involved in gastrulation in the full embryonic context. To address this, we established zebrafish embryonic explants without the extraembryonic yolk cell, an important player as a signaling source and for morphogenesis during gastrulation, as a model of ex vivo development. We found that dorsal-marginal determinants are required and sufficient in these explants to form and pattern all three germ layers. However, formation of tissues, which require the highest Nodal-signaling levels, is variable, demonstrating a contribution of extraembryonic tissues for reaching peak Nodal signaling levels. Blastoderm explants also undergo gastrulation-like axis elongation. We found that this elongation movement shows hallmarks of oriented mesendoderm cell intercalations typically associated with dorsal tissues in the intact embryo. These are disrupted by uniform upregulation of BMP signaling activity and concomitant explant ventralization, suggesting that tight spatial control of BMP signaling is a prerequisite for explant morphogenesis. This control is achieved by Nodal signaling, which is critical for effectively downregulating BMP signaling in the mesendoderm, highlighting that Nodal signaling is not only directly required for mesendoderm cell fate specification and morphogenesis, but also by maintaining low levels of BMP signaling at the dorsal side. Collectively, we provide insights into the capacity and organization of signaling and morphogenetic domains to recapitulate features of zebrafish gastrulation outside of the full embryonic context. AU - Schauer, Alexandra ID - 12891 SN - 2663 - 337X TI - Mesendoderm formation in zebrafish gastrulation: The role of extraembryonic tissues ER - TY - CONF AB - We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee. AU - Goranci, Gramoz AU - Henzinger, Monika H ID - 14085 SN - 1868-8969 T2 - 50th International Colloquium on Automata, Languages, and Programming TI - Efficient data structures for incremental exact and approximate maximum flow VL - 261 ER - TY - CONF AB - A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n]. The partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min) We develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph. AU - Harris, David G. AU - Kolmogorov, Vladimir ID - 14084 SN - 1868-8969 T2 - 50th International Colloquium on Automata, Languages, and Programming TI - Parameter estimation for Gibbs distributions VL - 261 ER - TY - CONF AB - The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014]. To achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges. AU - Henzinger, Monika H AU - Liu, Paul AU - Vondrák, Jan AU - Zheng, Da Wei ID - 14086 SN - 18688969 T2 - 50th International Colloquium on Automata, Languages, and Programming TI - Faster submodular maximization for several classes of matroids VL - 261 ER - TY - CONF AB - In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for all integer values of q ≥ 2. A code is called (p,L)_q-list-decodable if every radius pn Hamming ball contains less than L codewords; (p,𝓁,L)_q-list-recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length 𝓁 and again stipulate that there be less than L codewords. Our main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate (p,𝓁,L)_q-list-recoverable codes, the quantity we call the zero-rate threshold. Denoting this value by p_*, we in fact show that codes correcting a p_*+ε fraction of errors must have size O_ε(1), i.e., independent of n. Such a result is typically referred to as a "Plotkin bound." To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p_*-ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery. Technically, proving the Plotkin bound boils down to demonstrating the Schur convexity of a certain function defined on the q-simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q-ary list-decoding; however, we point out that this earlier proof is flawed. AU - Resch, Nicolas AU - Yuan, Chen AU - Zhang, Yihan ID - 14083 SN - 1868-8969 T2 - 50th International Colloquium on Automata, Languages, and Programming TI - Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery VL - 261 ER - TY - JOUR AB - Models for same-material contact electrification in granular media often rely on a local charge-driving parameter whose spatial variations lead to a stochastic origin for charge exchange. Measuring the charge transfer from individual granular spheres after contacts with substrates of the same material, we find instead a “global” charging behavior, coherent over the sample’s whole surface. Cleaning and baking samples fully resets charging magnitude and direction, which indicates the underlying global parameter is not intrinsic to the material, but acquired from its history. Charging behavior is randomly and irreversibly affected by changes in relative humidity, hinting at a mechanism where adsorbates, in particular, water, are fundamental to the charge-transfer process. AU - Grosjean, Galien M AU - Waitukaitis, Scott R ID - 12697 IS - 9 JF - Physical Review Letters KW - General Physics KW - Electrostatics KW - Triboelectricity KW - Soft Matter KW - Acoustic Levitation KW - Granular Materials SN - 0031-9007 TI - Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media VL - 130 ER - TY - THES AB - About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. Quantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. Till date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. After decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. Optical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. In this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. With this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. AU - Sahu, Rishabh ID - 13175 KW - quantum optics KW - electrooptics KW - quantum networks KW - quantum communication KW - transduction SN - 2663 - 337X TI - Cavity quantum electrooptics ER - TY - THES AB - About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. Quantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. Till date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. After decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. Optical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. In this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. With this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. AU - Sahu, Rishabh ID - 12900 KW - quantum optics KW - electrooptics KW - quantum networks KW - quantum communication KW - transduction SN - 2663 - 337X TI - Cavity quantum electrooptics ER - TY - CONF AB - We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs. AU - Lechner, Mathias AU - Zikelic, Dorde AU - Chatterjee, Krishnendu AU - Henzinger, Thomas A AU - Rus, Daniela ID - 14242 IS - 12 SN - 9781577358800 T2 - Proceedings of the 37th AAAI Conference on Artificial Intelligence TI - Quantization-aware interval bound propagation for training certifiably robust quantized neural networks VL - 37 ER - TY - CONF AB - Two-player zero-sum "graph games" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In "bidding games", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with "mean-payoff" objectives in combination with "poorman" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the "value" under pure strategies does not necessarily exist in such games. AU - Avni, Guy AU - Jecker, Ismael R AU - Zikelic, Dorde ID - 14243 IS - 5 SN - 9781577358800 T2 - Proceedings of the 37th AAAI Conference on Artificial Intelligence TI - Bidding graph games with partially-observable budgets VL - 37 ER - TY - CONF AB - We present a technique to optimize the reflectivity of a surface while preserving its overall shape. The naïve optimization of the mesh vertices using the gradients of reflectivity simulations results in undesirable distortion. In contrast, our robust formulation optimizes the surface normal as an independent variable that bridges the reflectivity term with differential rendering, and the regularization term with as-rigid-as-possible elastic energy. We further adaptively subdivide the input mesh to improve the convergence. Consequently, our method can minimize the retroreflectivity of a wide range of input shapes, resulting in sharply creased shapes ubiquitous among stealth aircraft and Sci-Fi vehicles. Furthermore, by changing the reward for the direction of the outgoing light directions, our method can be applied to other reflectivity design tasks, such as the optimization of architectural walls to concentrate light in a specific region. We have tested the proposed method using light-transport simulations and real-world 3D-printed objects. AU - Tojo, Kenji AU - Shamir, Ariel AU - Bickel, Bernd AU - Umetani, Nobuyuki ID - 14241 SN - 9798400701597 T2 - SIGGRAPH 2023 Conference Proceedings TI - Stealth shaper: Reflectivity optimization as surface stylization ER -