TY - CONF AB - Despite their recent success, deep neural networks continue to perform poorly when they encounter distribution shifts at test time. Many recently proposed approaches try to counter this by aligning the model to the new distribution prior to inference. With no labels available this requires unsupervised objectives to adapt the model on the observed test data. In this paper, we propose Test-Time SelfTraining (TeST): a technique that takes as input a model trained on some source data and a novel data distribution at test time, and learns invariant and robust representations using a student-teacher framework. We find that models adapted using TeST significantly improve over baseline testtime adaptation algorithms. TeST achieves competitive performance to modern domain adaptation algorithms [4, 43], while having access to 5-10x less data at time of adaption. We thoroughly evaluate a variety of baselines on two tasks: object detection and image segmentation and find that models adapted with TeST. We find that TeST sets the new stateof-the art for test-time domain adaptation algorithms. AU - Sinha, Samarth AU - Gehler, Peter AU - Locatello, Francesco AU - Schiele, Bernt ID - 14105 SN - 9781665493475 T2 - 2023 IEEE/CVF Winter Conference on Applications of Computer Vision TI - TeST: Test-time Self-Training under distribution shift ER - TY - JOUR AB - Context. Space asteroseismology is revolutionizing our knowledge of the internal structure and dynamics of stars. A breakthrough is ongoing with the recent discoveries of signatures of strong magnetic fields in the core of red giant stars. The key signature for such a detection is the asymmetry these fields induce in the frequency splittings of observed dipolar mixed gravito-acoustic modes. Aims. We investigate the ability of the observed asymmetries of the frequency splittings of dipolar mixed modes to constrain the geometrical properties of deep magnetic fields. Methods. We used the powerful analytical Racah-Wigner algebra used in quantum mechanics to characterize the geometrical couplings of dipolar mixed oscillation modes with various realistically plausible topologies of fossil magnetic fields. We also computed the induced perturbation of their frequencies. Results. First, in the case of an oblique magnetic dipole, we provide the exact analytical expression of the asymmetry as a function of the angle between the rotation and magnetic axes. Its value provides a direct measure of this angle. Second, considering a combination of axisymmetric dipolar and quadrupolar fields, we show how the asymmetry is blind to the unraveling of the relative strength and sign of each component. Finally, in the case of a given multipole, we show that a negative asymmetry is a signature of non-axisymmetric topologies. Conclusions. Asymmetries of dipolar mixed modes provide a key bit of information on the geometrical topology of deep fossil magnetic fields, but this is insufficient on its own. Asteroseismic constraints should therefore be combined with spectropolarimetric observations and numerical simulations, which aim to predict the more probable stable large-scale geometries. AU - Mathis, S. AU - Bugnet, Lisa Annabelle ID - 14256 JF - Astronomy and Astrophysics SN - 0004-6361 TI - Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields VL - 676 ER - TY - JOUR AB - In this work, a generalized, adapted Numerov implementation capable of determining band structures of periodic quantum systems is outlined. Based on the input potential, the presented approach numerically solves the Schrödinger equation in position space at each momentum space point. Thus, in addition to the band structure, the method inherently provides information about the state functions and probability densities in position space at each momentum space point considered. The generalized, adapted Numerov framework provided reliable estimates for a variety of increasingly complex test suites in one, two, and three dimensions. The accuracy of the proposed methodology was benchmarked against results obtained for the analytically solvable Kronig-Penney model. Furthermore, the presented numerical solver was applied to a model potential representing a 2D optical lattice being a challenging application relevant, for example, in the field of quantum computing. AU - Gamper, Jakob AU - Kluibenschedl, Florian AU - Weiss, Alexander K.H. AU - Hofer, Thomas S. ID - 14261 IS - 33 JF - Journal of Physical Chemistry Letters TI - Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems VL - 14 ER - TY - CONF AB - This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayes-optimal test error for classification while obtaining (nearly) zero-training error under the lazy training regime. For this purpose, we unify three interrelated concepts of overparameterization, benign overfitting, and the Lipschitz constant of DNNs. Our results indicate that interpolating with smoother functions leads to better generalization. Furthermore, we investigate the special case where interpolating smooth ground-truth functions is performed by DNNs under the Neural Tangent Kernel (NTK) regime for generalization. Our result demonstrates that the generalization error converges to a constant order that only depends on label noise and initialization noise, which theoretically verifies benign overfitting. Our analysis provides a tight lower bound on the normalized margin under non-smooth activation functions, as well as the minimum eigenvalue of NTK under high-dimensional settings, which has its own interest in learning theory. AU - Zhu, Zhenyu AU - Liu, Fanghui AU - Chrysos, Grigorios G AU - Locatello, Francesco AU - Cevher, Volkan ID - 14208 T2 - Proceedings of the 40th International Conference on Machine Learning TI - Benign overfitting in deep neural networks under lazy training VL - 202 ER - TY - GEN AB - Diffusion models excel at generating photorealistic images from text-queries. Naturally, many approaches have been proposed to use these generative abilities to augment training datasets for downstream tasks, such as classification. However, diffusion models are themselves trained on large noisily supervised, but nonetheless, annotated datasets. It is an open question whether the generalization capabilities of diffusion models beyond using the additional data of the pre-training process for augmentation lead to improved downstream performance. We perform a systematic evaluation of existing methods to generate images from diffusion models and study new extensions to assess their benefit for data augmentation. While we find that personalizing diffusion models towards the target data outperforms simpler prompting strategies, we also show that using the training data of the diffusion model alone, via a simple nearest neighbor retrieval procedure, leads to even stronger downstream performance. Overall, our study probes the limitations of diffusion models for data augmentation but also highlights its potential in generating new training data to improve performance on simple downstream vision tasks. AU - Burg, Max F. AU - Wenzel, Florian AU - Zietlow, Dominik AU - Horn, Max AU - Makansi, Osama AU - Locatello, Francesco AU - Russell, Chris ID - 14209 T2 - arXiv TI - A data augmentation perspective on diffusion models and retrieval ER - TY - CONF AB - Causal discovery methods are intrinsically constrained by the set of assumptions needed to ensure structure identifiability. Moreover additional restrictions are often imposed in order to simplify the inference task: this is the case for the Gaussian noise assumption on additive non-linear models, which is common to many causal discovery approaches. In this paper we show the shortcomings of inference under this hypothesis, analyzing the risk of edge inversion under violation of Gaussianity of the noise terms. Then, we propose a novel method for inferring the topological ordering of the variables in the causal graph, from data generated according to an additive non-linear model with a generic noise distribution. This leads to NoGAM (Not only Gaussian Additive noise Models), a causal discovery algorithm with a minimal set of assumptions and state of the art performance, experimentally benchmarked on synthetic data. AU - Montagna, Francesco AU - Noceti, Nicoletta AU - Rosasco, Lorenzo AU - Zhang, Kun AU - Locatello, Francesco ID - 14211 T2 - 2nd Conference on Causal Learning and Reasoning TI - Causal discovery with score matching on additive models with arbitrary noise ER - TY - CONF AB - This paper demonstrates how to discover the whole causal graph from the second derivative of the log-likelihood in observational non-linear additive Gaussian noise models. Leveraging scalable machine learning approaches to approximate the score function ∇logp(X), we extend the work of Rolland et al. (2022) that only recovers the topological order from the score and requires an expensive pruning step removing spurious edges among those admitted by the ordering. Our analysis leads to DAS (acronym for Discovery At Scale), a practical algorithm that reduces the complexity of the pruning by a factor proportional to the graph size. In practice, DAS achieves competitive accuracy with current state-of-the-art while being over an order of magnitude faster. Overall, our approach enables principled and scalable causal discovery, significantly lowering the compute bar. AU - Montagna, Francesco AU - Noceti, Nicoletta AU - Rosasco, Lorenzo AU - Zhang, Kun AU - Locatello, Francesco ID - 14212 T2 - 2nd Conference on Causal Learning and Reasoning TI - Scalable causal discovery with score matching ER - TY - CONF AB - Recent years have seen a surge of interest in learning high-level causal representations from low-level image pairs under interventions. Yet, existing efforts are largely limited to simple synthetic settings that are far away from real-world problems. In this paper, we present Causal Triplet, a causal representation learning benchmark featuring not only visually more complex scenes, but also two crucial desiderata commonly overlooked in previous works: (i) an actionable counterfactual setting, where only certain object-level variables allow for counterfactual observations whereas others do not; (ii) an interventional downstream task with an emphasis on out-of-distribution robustness from the independent causal mechanisms principle. Through extensive experiments, we find that models built with the knowledge of disentangled or object-centric representations significantly outperform their distributed counterparts. However, recent causal representation learning methods still struggle to identify such latent structures, indicating substantial challenges and opportunities for future work. AU - Liu, Yuejiang AU - Alahi, Alexandre AU - Russell, Chris AU - Horn, Max AU - Zietlow, Dominik AU - Schölkopf, Bernhard AU - Locatello, Francesco ID - 14214 T2 - 2nd Conference on Causal Learning and Reasoning TI - Causal triplet: An open challenge for intervention-centric causal representation learning ER - TY - CONF AB - Neural networks embed the geometric structure of a data manifold lying in a high-dimensional space into latent representations. Ideally, the distribution of the data points in the latent space should depend only on the task, the data, the loss, and other architecture-specific constraints. However, factors such as the random weights initialization, training hyperparameters, or other sources of randomness in the training phase may induce incoherent latent spaces that hinder any form of reuse. Nevertheless, we empirically observe that, under the same data and modeling choices, the angles between the encodings within distinct latent spaces do not change. In this work, we propose the latent similarity between each sample and a fixed set of anchors as an alternative data representation, demonstrating that it can enforce the desired invariances without any additional training. We show how neural architectures can leverage these relative representations to guarantee, in practice, invariance to latent isometries and rescalings, effectively enabling latent space communication: from zero-shot model stitching to latent space comparison between diverse settings. We extensively validate the generalization capability of our approach on different datasets, spanning various modalities (images, text, graphs), tasks (e.g., classification, reconstruction) and architectures (e.g., CNNs, GCNs, transformers). AU - Moschella, Luca AU - Maiorca, Valentino AU - Fumero, Marco AU - Norelli, Antonio AU - Locatello, Francesco AU - Rodolà, Emanuele ID - 14217 T2 - The 11th International Conference on Learning Representations TI - Relative representations enable zero-shot latent space communication ER - TY - CONF AB - Learning generative object models from unlabelled videos is a long standing problem and required for causal scene modeling. We decompose this problem into three easier subtasks, and provide candidate solutions for each of them. Inspired by the Common Fate Principle of Gestalt Psychology, we first extract (noisy) masks of moving objects via unsupervised motion segmentation. Second, generative models are trained on the masks of the background and the moving objects, respectively. Third, background and foreground models are combined in a conditional "dead leaves" scene model to sample novel scene configurations where occlusions and depth layering arise naturally. To evaluate the individual stages, we introduce the Fishbowl dataset positioned between complex real-world scenes and common object-centric benchmarks of simplistic objects. We show that our approach allows learning generative models that generalize beyond the occlusions present in the input videos, and represent scenes in a modular fashion that allows sampling plausible scenes outside the training distribution by permitting, for instance, object numbers or densities not observed in the training set. AU - Tangemann, Matthias AU - Schneider, Steffen AU - Kügelgen, Julius von AU - Locatello, Francesco AU - Gehler, Peter AU - Brox, Thomas AU - Kümmerer, Matthias AU - Bethge, Matthias AU - Schölkopf, Bernhard ID - 14222 T2 - 2nd Conference on Causal Learning and Reasoning TI - Unsupervised object learning via common fate ER - TY - CONF AB - Humans naturally decompose their environment into entities at the appropriate level of abstraction to act in the world. Allowing machine learning algorithms to derive this decomposition in an unsupervised way has become an important line of research. However, current methods are restricted to simulated data or require additional information in the form of motion or depth in order to successfully discover objects. In this work, we overcome this limitation by showing that reconstructing features from models trained in a self-supervised manner is a sufficient training signal for object-centric representations to arise in a fully unsupervised way. Our approach, DINOSAUR, significantly out-performs existing image-based object-centric learning models on simulated data and is the first unsupervised object-centric model that scales to real-world datasets such as COCO and PASCAL VOC. DINOSAUR is conceptually simple and shows competitive performance compared to more involved pipelines from the computer vision literature. AU - Seitzer, Maximilian AU - Horn, Max AU - Zadaianchuk, Andrii AU - Zietlow, Dominik AU - Xiao, Tianjun AU - Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel AU - He, Tong AU - Zhang, Zheng AU - Schölkopf, Bernhard AU - Brox, Thomas AU - Locatello, Francesco ID - 14218 T2 - The 11th International Conference on Learning Representations TI - Bridging the gap to real-world object-centric learning ER - TY - CONF AB - In this paper, we show that recent advances in self-supervised feature learning enable unsupervised object discovery and semantic segmentation with a performance that matches the state of the field on supervised semantic segmentation 10 years ago. We propose a methodology based on unsupervised saliency masks and self-supervised feature clustering to kickstart object discovery followed by training a semantic segmentation network on pseudo-labels to bootstrap the system on images with multiple objects. We present results on PASCAL VOC that go far beyond the current state of the art (50.0 mIoU), and we report for the first time results on MS COCO for the whole set of 81 classes: our method discovers 34 categories with more than $20\%$ IoU, while obtaining an average IoU of 19.6 for all 81 categories. AU - Zadaianchuk, Andrii AU - Kleindessner, Matthaeus AU - Zhu, Yi AU - Locatello, Francesco AU - Brox, Thomas ID - 14219 T2 - The 11th International Conference on Learning Representations TI - Unsupervised semantic segmentation with self-supervised object-centric representations ER - TY - GEN AB - As causal ground truth is incredibly rare, causal discovery algorithms are commonly only evaluated on simulated data. This is concerning, given that simulations reflect common preconceptions about generating processes regarding noise distributions, model classes, and more. In this work, we propose a novel method for falsifying the output of a causal discovery algorithm in the absence of ground truth. Our key insight is that while statistical learning seeks stability across subsets of data points, causal learning should seek stability across subsets of variables. Motivated by this insight, our method relies on a notion of compatibility between causal graphs learned on different subsets of variables. We prove that detecting incompatibilities can falsify wrongly inferred causal relations due to violation of assumptions or errors from finite sample effects. Although passing such compatibility tests is only a necessary criterion for good performance, we argue that it provides strong evidence for the causal models whenever compatibility entails strong implications for the joint distribution. We also demonstrate experimentally that detection of incompatibilities can aid in causal model selection. AU - Faller, Philipp M. AU - Vankadara, Leena Chennuru AU - Mastakouri, Atalanti A. AU - Locatello, Francesco AU - Janzing, Dominik ID - 14333 T2 - arXiv TI - Self-compatibility: Evaluating causal discovery without ground truth ER - TY - JOUR AB - Living tissues are characterized by an intrinsically mechanochemical interplay of active physical forces and complex biochemical signaling pathways. Either feature alone can give rise to complex emergent phenomena, for example, mechanically driven glassy dynamics and rigidity transitions, or chemically driven reaction-diffusion instabilities. An important question is how to quantitatively assess the contribution of these different cues to the large-scale dynamics of biological materials. We address this in Madin-Darby canine kidney (MDCK) monolayers, considering both mechanochemical feedback between extracellular signal-regulated kinase (ERK) signaling activity and cellular density as well as a mechanically active tissue rheology via a self-propelled vertex model. We show that the relative strength of active migration forces to mechanochemical couplings controls a transition from a uniform active glass to periodic spatiotemporal waves. We parametrize the model from published experimental data sets on MDCK monolayers and use it to make new predictions on the correlation functions of cellular dynamics and the dynamics of topological defects associated with the oscillatory phase of cells. Interestingly, MDCK monolayers are best described by an intermediary parameter region in which both mechanochemical couplings and noisy active propulsion have a strong influence on the dynamics. Finally, we study how tissue rheology and ERK waves produce feedback on one another and uncover a mechanism via which tissue fluidity can be controlled by mechanochemical waves at both the local and global levels. AU - Boocock, Daniel R AU - Hirashima, Tsuyoshi AU - Hannezo, Edouard B ID - 14277 IS - 1 JF - PRX Life SN - 2835-8279 TI - Interplay between mechanochemical patterning and glassy dynamics in cellular monolayers VL - 1 ER - TY - JOUR AB - The execution of cognitive functions requires coordinated circuit activity across different brain areas that involves the associated firing of neuronal assemblies. Here, we tested the circuit mechanism behind assembly interactions between the hippocampus and the medial prefrontal cortex (mPFC) of adult rats by recording neuronal populations during a rule-switching task. We identified functionally coupled CA1-mPFC cells that synchronized their activity beyond that expected from common spatial coding or oscillatory firing. When such cell pairs fired together, the mPFC cell strongly phase locked to CA1 theta oscillations and maintained consistent theta firing phases, independent of the theta timing of their CA1 counterpart. These functionally connected CA1-mPFC cells formed interconnected assemblies. While firing together with their CA1 assembly partners, mPFC cells fired along specific theta sequences. Our results suggest that upregulated theta oscillatory firing of mPFC cells can signal transient interactions with specific CA1 assemblies, thus enabling distributed computations. AU - Nardin, Michele AU - Käfer, Karola AU - Stella, Federico AU - Csicsvari, Jozsef L ID - 14314 IS - 9 JF - Cell Reports TI - Theta oscillations as a substrate for medial prefrontal-hippocampal assembly interactions VL - 42 ER - TY - JOUR AB - During apoptosis, caspases degrade 8 out of ~30 nucleoporins to irreversibly demolish the nuclear pore complex. However, for poorly understood reasons, caspases are also activated during cell differentiation. Here, we show that sublethal activation of caspases during myogenesis results in the transient proteolysis of four peripheral Nups and one transmembrane Nup. ‘Trimmed’ NPCs become nuclear export-defective, and we identified in an unbiased manner several classes of cytoplasmic, plasma membrane, and mitochondrial proteins that rapidly accumulate in the nucleus. NPC trimming by non-apoptotic caspases was also observed in neurogenesis and endoplasmic reticulum stress. Our results suggest that caspases can reversibly modulate nuclear transport activity, which allows them to function as agents of cell differentiation and adaptation at sublethal levels. AU - Cho, Ukrae H. AU - Hetzer, Martin W ID - 14315 JF - eLife TI - Caspase-mediated nuclear pore complex trimming in cell differentiation and endoplasmic reticulum stress VL - 12 ER - TY - JOUR AB - We study multigraphs whose edge-sets are the union of three perfect matchings, M1, M2, and M3. Given such a graph G and any a1; a2; a3 2 N with a1 +a2 +a3 6 n - 2, we show there exists a matching M of G with jM \ Mij = ai for each i 2 f1; 2; 3g. The bound n - 2 in the theorem is best possible in general. We conjecture however that if G is bipartite, the same result holds with n - 2 replaced by n - 1. We give a construction that shows such a result would be tight. We also make a conjecture generalising the Ryser-Brualdi-Stein conjecture with colour multiplicities. AU - Anastos, Michael AU - Fabian, David AU - Müyesser, Alp AU - Szabó, Tibor ID - 14319 IS - 3 JF - Electronic Journal of Combinatorics TI - Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets VL - 30 ER - TY - CONF AB - Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit κ, we consider the tail probability Pr[T≥κ], i.e., the probability that the randomized runtime T of the PRR exceeds κ. Our focus is the formal analysis of tail bounds that aims at finding a tight asymptotic upper bound u≥Pr[T≥κ]. To address this problem, the classical and most well-known approach is the cookbook method by Karp (JACM 1994), while other approaches are mostly limited to deriving tail bounds of specific PRRs via involved custom analysis. In this work, we propose a novel approach for deriving the common exponentially-decreasing tail bounds for PRRs whose preprocessing time and random passed sizes observe discrete or (piecewise) uniform distribution and whose recursive call is either a single procedure call or a divide-and-conquer. We first establish a theoretical approach via Markov’s inequality, and then instantiate the theoretical approach with a template-based algorithmic approach via a refined treatment of exponentiation. Experimental evaluation shows that our algorithmic approach is capable of deriving tail bounds that are (i) asymptotically tighter than Karp’s method, (ii) match the best-known manually-derived asymptotic tail bound for QuickSelect, and (iii) is only slightly worse (with a loglogn factor) than the manually-proven optimal asymptotic tail bound for QuickSort. Moreover, our algorithmic approach handles all examples (including realistic PRRs such as QuickSort, QuickSelect, DiameterComputation, etc.) in less than 0.1 s, showing that our approach is efficient in practice. AU - Sun, Yican AU - Fu, Hongfei AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar ID - 14318 SN - 0302-9743 T2 - Computer Aided Verification TI - Automated tail bound analysis for probabilistic recurrence relations VL - 13966 ER - TY - CONF AB - Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason about trajectories of distributions, basic reachability and safety problems are known to be computationally intractable (i.e., Skolem-hard) to solve in such models. Further, we show that even for simple examples of MDPs, strategies for safety objectives over distributions can require infinite memory and randomization. In light of this, we present a novel overapproximation approach to synthesize strategies in an MDP, such that a safety objective over the distributions is met. More precisely, we develop a new framework for template-based synthesis of certificates as affine distributional and inductive invariants for safety objectives in MDPs. We provide two algorithms within this framework. One can only synthesize memoryless strategies, but has relative completeness guarantees, while the other can synthesize general strategies. The runtime complexity of both algorithms is in PSPACE. We implement these algorithms and show that they can solve several non-trivial examples. AU - Akshay, S. AU - Chatterjee, Krishnendu AU - Meggendorfer, Tobias AU - Zikelic, Dorde ID - 14317 SN - 0302-9743 T2 - International Conference on Computer Aided Verification TI - MDPs as distribution transformers: Affine invariant synthesis for safety objectives VL - 13966 ER - TY - JOUR AB - Clathrin-mediated vesicle trafficking plays central roles in post-Golgi transport. In yeast (Saccharomyces cerevisiae), the AP-1 complex and GGA adaptors are predicted to generate distinct transport vesicles at the trans-Golgi network (TGN), and the epsin-related proteins Ent3p and Ent5p (collectively Ent3p/5p) act as accessories for these adaptors. Recently, we showed that vesicle transport from the TGN is crucial for yeast Rab5 (Vps21p)-mediated endosome formation, and that Ent3p/5p are crucial for this process, whereas AP-1 and GGA adaptors are dispensable. However, these observations were incompatible with previous studies showing that these adaptors are required for Ent3p/5p recruitment to the TGN, and thus the overall mechanism responsible for regulation of Vps21p activity remains ambiguous. Here, we investigated the functional relationships between clathrin adaptors in post-Golgi-mediated Vps21p activation. We show that AP-1 disruption in the ent3Δ5Δ mutant impaired transport of the Vps21p guanine nucleotide exchange factor Vps9p transport to the Vps21p compartment and severely reduced Vps21p activity. Additionally, GGA adaptors, the phosphatidylinositol-4-kinase Pik1p and Rab11 GTPases Ypt31p and Ypt32p were found to have partially overlapping functions for recruitment of AP-1 and Ent3p/5p to the TGN. These findings suggest a distinct role of clathrin adaptors for Vps21p activation in the TGN–endosome trafficking pathway. AU - Nagano, Makoto AU - Aoshima, Kaito AU - Shimamura, Hiroki AU - Siekhaus, Daria E AU - Toshima, Junko Y. AU - Toshima, Jiro ID - 14316 IS - 17 JF - Journal of Cell Science SN - 0021-9533 TI - Distinct role of TGN-resident clathrin adaptors for Vps21p activation in the TGN-endosome trafficking pathway VL - 136 ER - TY - JOUR AB - The development of two-dimensional materials has resulted in a diverse range of novel, high-quality compounds with increasing complexity. A key requirement for a comprehensive quantitative theory is the accurate determination of these materials' band structure parameters. However, this task is challenging due to the intricate band structures and the indirect nature of experimental probes. In this work, we introduce a general framework to derive band structure parameters from experimental data using deep neural networks. We applied our method to the penetration field capacitance measurement of trilayer graphene, an effective probe of its density of states. First, we demonstrate that a trained deep network gives accurate predictions for the penetration field capacitance as a function of tight-binding parameters. Next, we use the fast and accurate predictions from the trained network to automatically determine tight-binding parameters directly from experimental data, with extracted parameters being in a good agreement with values in the literature. We conclude by discussing potential applications of our method to other materials and experimental techniques beyond penetration field capacitance. AU - Henderson, Paul M AU - Ghazaryan, Areg AU - Zibrov, Alexander A. AU - Young, Andrea F. AU - Serbyn, Maksym ID - 14320 IS - 12 JF - Physical Review B SN - 2469-9950 TI - Deep learning extraction of band structure parameters from density of states: A case study on trilayer graphene VL - 108 ER - TY - THES AB - Nonergodic systems, whose out-of-equilibrium dynamics fail to thermalize, provide a fascinating research direction both for fundamental reasons and for application in state of the art quantum devices. Going beyond the description of statistical mechanics, ergodicity breaking yields a new paradigm in quantum many-body physics, introducing novel phases of matter with no counterpart at equilibrium. In this Thesis, we address different open questions in the field, focusing on disorder-induced many-body localization (MBL) and on weak ergodicity breaking in kinetically constrained models. In particular, we contribute to the debate about transport in kinetically constrained models, studying the effect of $U(1)$ conservation and inversion-symmetry breaking in a family of quantum East models. Using tensor network techniques, we analyze the dynamics of large MBL systems beyond the limit of exact numerical methods. In this setting, we approach the debated topic of the coexistence of localized and thermal eigenstates separated by energy thresholds known as many-body mobility edges. Inspired by recent experiments, our work further investigates the localization of a small bath induced by the coupling to a large localized chain, the so-called MBL proximity effect. In the first Chapter, we introduce a family of particle-conserving kinetically constrained models, inspired by the quantum East model. The system we study features strong inversion-symmetry breaking, due to the nature of the correlated hopping. We show that these models host so-called quantum Hilbert space fragmentation, consisting of disconnected subsectors in an entangled basis, and further provide an analytical description of this phenomenon. We further probe its effect on dynamics of simple product states, showing revivals in fidelity and local observalbes. The study of dynamics within the largest subsector reveals an anomalous transient superdiffusive behavior crossing over to slow logarithmic dynamics at later times. This work suggests that particle conserving constrained models with inversion-symmetry breaking realize new universality classes of dynamics and invite their further theoretical and experimental studies. Next, we use kinetic constraints and disorder to design a model with many-body mobility edges in particle density. This feature allows to study the dynamics of localized and thermal states in large systems beyond the limitations of previous studies. The time-evolution shows typical signatures of localization at small densities, replaced by thermal behavior at larger densities. Our results provide evidence in favor of the stability of many-body mobility edges, which was recently challenged by a theoretical argument. To support our findings, we probe the mechanism proposed as a cause of delocalization in many-body localized systems with mobility edges suggesting its ineffectiveness in the model studied. In the last Chapter of this Thesis, we address the topic of many-body localization proximity effect. We study a model inspired by recent experiments, featuring Anderson localized coupled to a small bath of free hard-core bosons. The interaction among the two particle species results in non-trivial dynamics, which we probe using tensor network techniques. Our simulations show convincing evidence of many-body localization proximity effect when the bath is composed by a single free particle and interactions are strong. We furthter observe an anomalous entanglement dynamics, which we explain through a phenomenological theory. Finally, we extract highly excited eigenstates of large systems, providing supplementary evidence in favor of our findings. AU - Brighi, Pietro ID - 12732 SN - 2663-337X TI - Ergodicity breaking in disordered and kinetically constrained quantum many-body systems ER - TY - JOUR AB - 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 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 dynamical behavior and invite their further theoretical and experimental studies. AU - Brighi, Pietro AU - Ljubotina, Marko AU - Serbyn, Maksym ID - 14334 IS - 3 JF - SciPost Physics KW - General Physics and Astronomy SN - 2542-4653 TI - Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models VL - 15 ER - TY - JOUR AB - We demonstrate the possibility of a coupling between the magnetization direction of a ferromagnet and the tilting angle of adsorbed achiral molecules. To illustrate the mechanism of the coupling, we analyze a minimal Stoner model that includes Rashba spin–orbit coupling due to the electric field on the surface of the ferromagnet. The proposed mechanism allows us to study magnetic anisotropy of the system with an extended Stoner–Wohlfarth model and argue that adsorbed achiral molecules can change magnetocrystalline anisotropy of the substrate. Our research aims to motivate further experimental studies of the current-free chirality induced spin selectivity effect involving both enantiomers. AU - Al Hyder, Ragheed AU - Cappellaro, Alberto AU - Lemeshko, Mikhail AU - Volosniev, Artem ID - 14321 IS - 10 JF - The Journal of Chemical Physics KW - Physical and Theoretical Chemistry KW - General Physics and Astronomy SN - 0021-9606 TI - Achiral dipoles on a ferromagnet can affect its magnetization direction VL - 159 ER - TY - JOUR AB - We propose a simple method to measure nonlinear Kerr refractive index in mid-infrared frequency range that avoids using sophisticated infrared detectors. Our approach is based on using a near-infrared probe beam which interacts with a mid-IR beam via wavelength-non-degenerate cross-phase modulation (XPM). By carefully measuring XPM-induced spectral modifications in the probe beam and comparing the experimental data with simulation results, we extract the value for the non-degenerate Kerr index. Finally, in order to obtain the value of degenerate mid-IR Kerr index, we use the well-established two-band formalism of Sheik-Bahae et al., which is shown to become particularly simple in the limit of low frequencies. The proposed technique is complementary to the conventional techniques, such as z-scan, and has the advantage of not requiring any mid-infrared detectors. AU - Lorenc, Dusan AU - Alpichshev, Zhanybek ID - 14342 IS - 9 JF - Applied Physics Letters SN - 0003-6951 TI - Mid-infrared Kerr index evaluation via cross-phase modulation with a near-infrared probe beam VL - 123 ER - TY - JOUR AB - Flows through pipes and channels are, in practice, almost always turbulent, and the multiscale eddying motion is responsible for a major part of the encountered friction losses and pumping costs1. Conversely, for pulsatile flows, in particular for aortic blood flow, turbulence levels remain low despite relatively large peak velocities. For aortic blood flow, high turbulence levels are intolerable as they would damage the shear-sensitive endothelial cell layer2,3,4,5. Here we show that turbulence in ordinary pipe flow is diminished if the flow is driven in a pulsatile mode that incorporates all the key features of the cardiac waveform. At Reynolds numbers comparable to those of aortic blood flow, turbulence is largely inhibited, whereas at much higher speeds, the turbulent drag is reduced by more than 25%. This specific operation mode is more efficient when compared with steady driving, which is the present situation for virtually all fluid transport processes ranging from heating circuits to water, gas and oil pipelines. AU - Scarselli, Davide AU - Lopez Alonso, Jose M AU - Varshney, Atul AU - Hof, Björn ID - 14341 IS - 7977 JF - Nature SN - 0028-0836 TI - Turbulence suppression by cardiac-cycle-inspired driving of pipe flow VL - 621 ER - TY - JOUR AB - Purpose: Biallelic variants in TARS2, encoding the mitochondrial threonyl-tRNA-synthetase, have been reported in a small group of individuals displaying a neurodevelopmental phenotype but with limited neuroradiological data and insufficient evidence for causality of the variants. Methods: Exome or genome sequencing was carried out in 15 families. Clinical and neuroradiological evaluation was performed for all affected individuals, including review of 10 previously reported individuals. The pathogenicity of TARS2 variants was evaluated using in vitro assays and a zebrafish model. Results: We report 18 new individuals harboring biallelic TARS2 variants. Phenotypically, these individuals show developmental delay/intellectual disability, regression, cerebellar and cerebral atrophy, basal ganglia signal alterations, hypotonia, cerebellar signs, and increased blood lactate. In vitro studies showed that variants within the TARS2301-381 region had decreased binding to Rag GTPases, likely impairing mTORC1 activity. The zebrafish model recapitulated key features of the human phenotype and unraveled dysregulation of downstream targets of mTORC1 signaling. Functional testing of the variants confirmed the pathogenicity in a zebrafish model. Conclusion: We define the clinico-radiological spectrum of TARS2-related mitochondrial disease, unveil the likely involvement of the mTORC1 signaling pathway as a distinct molecular mechanism, and establish a TARS2 zebrafish model as an important tool to study variant pathogenicity. AU - Accogli, Andrea AU - Lin, Sheng-Jia AU - Severino, Mariasavina AU - Kim, Sung-Hoon AU - Huang, Kevin AU - Rocca, Clarissa AU - Landsverk, Megan AU - Zaki, Maha S. AU - Al-Maawali, Almundher AU - Srinivasan, Varunvenkat M. AU - Al-Thihli, Khalid AU - Schaefer, G. Bradly AU - Davis, Monica AU - Tonduti, Davide AU - Doneda, Chiara AU - Marten, Lara M. AU - Mühlhausen, Chris AU - Gomez, Maria AU - Lamantea, Eleonora AU - Mena, Rafael AU - Nizon, Mathilde AU - Procaccio, Vincent AU - Begtrup, Amber AU - Telegrafi, Aida AU - Cui, Hong AU - Schulz, Heidi L. AU - Mohr, Julia AU - Biskup, Saskia AU - Loos, Mariana Amina AU - Aráoz, Hilda Verónica AU - Salpietro, Vincenzo AU - Keppen, Laura Davis AU - Chitre, Manali AU - Petree, Cassidy AU - Raymond, Lucy AU - Vogt, Julie AU - Sawyer, Lindsey B. AU - Basinger, Alice A. AU - Pedersen, Signe Vandal AU - Pearson, Toni S. AU - Grange, Dorothy K. AU - Lingappa, Lokesh AU - McDunnah, Paige AU - Horvath, Rita AU - Cognè, Benjamin AU - Isidor, Bertrand AU - Hahn, Andreas AU - Gripp, Karen W. AU - Jafarnejad, Seyed Mehdi AU - Østergaard, Elsebet AU - Prada, Carlos E. AU - Ghezzi, Daniele AU - Gowda, Vykuntaraju K. AU - Taylor, Robert W. AU - Sonenberg, Nahum AU - Houlden, Henry AU - Sissler, Marie AU - Varshney, Gaurav K. AU - Maroofian, Reza ID - 14368 IS - 11 JF - Genetics in Medicine KW - Genetics (clinical) SN - 1098-3600 TI - Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder VL - 25 ER - TY - CONF AB - We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four operations: union, reversal, concatenation, and the Kleene star. The literature mostly focuses on Turing machine arguments, which are possibly more difficult to formalize. For the Kleene star, we could not follow the literature and came up with our own grammar-based construction. AU - Dvorak, Martin AU - Blanchette, Jasmin ID - 13120 SN - 9783959772846 T2 - 14th International Conference on Interactive Theorem Proving TI - Closure properties of general grammars - formally verified VL - 268 ER - TY - JOUR AB - Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled crossing number of a good drawing with no toothed hole. In general the number of toothed holes has to be added to the 8-approximation. In the special case of circular drawings the approximation factor is 8, this improves upon the 10-approximation of Fink et al. [14]. Our approach also works with the same approximation factor for families of pseudosegments, i.e., curves intersecting at most once. We also show how to compute a 9/2-approximation when the intersection graph of the pseudosegments is bipartite and has no toothed hole. AU - Arroyo Guevara, Alan M AU - Felsner, Stefan ID - 13969 IS - 6 JF - Journal of Graph Algorithms and Applications SN - 1526-1719 TI - Approximating the bundled crossing number VL - 27 ER - TY - CONF AB - We study the Hamilton cycle problem with input a random graph G ~ G(n,p) in two different settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one, we are given the adjacency matrix of G. In each of the two settings we derive a deterministic algorithm that w.h.p. either finds a Hamilton cycle or returns a certificate that such a cycle does not exist for p = p(n) ≥ 0. The running times of our algorithms are O(n) and respectively, each being best possible in its own setting. AU - Anastos, Michael ID - 14344 SN - 9781611977554 T2 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms TI - Fast algorithms for solving the Hamilton cycle problem with high probability VL - 2023 ER - TY - JOUR AB - Surface curvature both emerges from, and influences the behavior of, living objects at length scales ranging from cell membranes to single cells to tissues and organs. The relevance of surface curvature in biology is supported by numerous experimental and theoretical investigations in recent years. In this review, first, a brief introduction to the key ideas of surface curvature in the context of biological systems is given and the challenges that arise when measuring surface curvature are discussed. Giving an overview of the emergence of curvature in biological systems, its significance at different length scales becomes apparent. On the other hand, summarizing current findings also shows that both single cells and entire cell sheets, tissues or organisms respond to curvature by modulating their shape and their migration behavior. Finally, the interplay between the distribution of morphogens or micro-organisms and the emergence of curvature across length scales is addressed with examples demonstrating these key mechanistic principles of morphogenesis. Overall, this review highlights that curved interfaces are not merely a passive by-product of the chemical, biological, and mechanical processes but that curvature acts also as a signal that co-determines these processes. AU - Schamberger, Barbara AU - Ziege, Ricardo AU - Anselme, Karine AU - Ben Amar, Martine AU - Bykowski, Michał AU - Castro, André P.G. AU - Cipitria, Amaia AU - Coles, Rhoslyn A. AU - Dimova, Rumiana AU - Eder, Michaela AU - Ehrig, Sebastian AU - Escudero, Luis M. AU - Evans, Myfanwy E. AU - Fernandes, Paulo R. AU - Fratzl, Peter AU - Geris, Liesbet AU - Gierlinger, Notburga AU - Hannezo, Edouard B AU - Iglič, Aleš AU - Kirkensgaard, Jacob J.K. AU - Kollmannsberger, Philip AU - Kowalewska, Łucja AU - Kurniawan, Nicholas A. AU - Papantoniou, Ioannis AU - Pieuchot, Laurent AU - Pires, Tiago H.V. AU - Renner, Lars D. AU - Sageman-Furnas, Andrew O. AU - Schröder-Turk, Gerd E. AU - Sengupta, Anupam AU - Sharma, Vikas R. AU - Tagua, Antonio AU - Tomba, Caterina AU - Trepat, Xavier AU - Waters, Sarah L. AU - Yeo, Edwina F. AU - Roschger, Andreas AU - Bidan, Cécile M. AU - Dunlop, John W.C. ID - 12710 IS - 13 JF - Advanced Materials SN - 0935-9648 TI - Curvature in biological systems: Its quantification, emergence, and implications across the scales VL - 35 ER - TY - JOUR AB - Coherent flows of self-propelled particles are characterized by vortices and jets that sustain chaotic flows, referred to as active turbulence. Here, we reveal a crossover between defect-free active turbulence and active turbulence laden with topological defects. Interestingly, we show that concurrent to the crossover from defect-free to defect-laden active turbulence is the restoration of the previously broken SO(2) symmetry signaled by the fast decay of the two-point correlations. By stability analyses of the topological charge density field, we provide theoretical insights on the criterion for the crossover to the defect-laden active turbulent state. Despite the distinct symmetry features between these two active turbulence regimes, the flow fluctuations exhibit universal statistical scaling behaviors at large scales, while the spectrum of polarity fluctuations decays exponentially at small length scales compared to the active energy injection length. These findings reveal a dynamical crossover between distinct spatiotemporal organization patterns in polar active matter. AU - Andersen, Benjamin H. AU - Renaud, Julian B AU - Rønning, Jonas AU - Angheluta, Luiza AU - Doostmohammadi, Amin ID - 14377 IS - 6 JF - Physical Review Fluids KW - Fluid Flow and Transfer Processes KW - Modeling and Simulation KW - Computational Mechanics SN - 2469-990X TI - Symmetry-restoring crossover from defect-free to defect-laden turbulence in polar active matter VL - 8 ER - TY - JOUR AB - Photoisomerization of azobenzenes from their stable E isomer to the metastable Z state is the basis of numerous applications of these molecules. However, this reaction typically requires ultraviolet light, which limits applicability. In this study, we introduce disequilibration by sensitization under confinement (DESC), a supramolecular approach to induce the E-to-Z isomerization by using light of a desired color, including red. DESC relies on a combination of a macrocyclic host and a photosensitizer, which act together to selectively bind and sensitize E-azobenzenes for isomerization. The Z isomer lacks strong affinity for and is expelled from the host, which can then convert additional E-azobenzenes to the Z state. In this way, the host–photosensitizer complex converts photon energy into chemical energy in the form of out-of-equilibrium photostationary states, including ones that cannot be accessed through direct photoexcitation. AU - Gemen, Julius AU - Church, Jonathan R. AU - Ruoko, Tero-Petri AU - Durandin, Nikita AU - Białek, Michał J. AU - Weissenfels, Maren AU - Feller, Moran AU - Kazes, Miri AU - Borin, Veniamin A. AU - Odaybat, Magdalena AU - Kalepu, Rishir AU - Diskin-Posner, Yael AU - Oron, Dan AU - Fuchter, Matthew J. AU - Priimagi, Arri AU - Schapiro, Igor AU - Klajn, Rafal ID - 13340 IS - 6664 JF - Science TI - Disequilibrating azoarenes by visible-light sensitization under confinement VL - 381 ER - TY - JOUR AB - The elasticity of disordered and polydisperse polymer networks is a fundamental problem of soft matter physics that is still open. Here, we self-assemble polymer networks via simulations of a mixture of bivalent and tri- or tetravalent patchy particles, which result in an exponential strand length distribution analogous to that of experimental randomly cross-linked systems. After assembly, the network connectivity and topology are frozen and the resulting system is characterized. We find that the fractal structure of the network depends on the number density at which the assembly has been carried out, but that systems with the same mean valence and same assembly density have the same structural properties. Moreover, we compute the long-time limit of the mean-squared displacement, also known as the (squared) localization length, of the cross-links and of the middle monomers of the strands, showing that the dynamics of long strands is well described by the tube model. Finally, we find a relation connecting these two localization lengths at high density and connect the cross-link localization length to the shear modulus of the system. AU - Sorichetti, Valerio AU - Ninarello, Andrea AU - Ruiz-Franco, José AU - Hugouvieux, Virginie AU - Zaccarelli, Emanuela AU - Micheletti, Cristian AU - Kob, Walter AU - Rovigatti, Lorenzo ID - 12705 IS - 7 JF - Journal of Chemical Physics SN - 0021-9606 TI - Structure and elasticity of model disordered, polydisperse, and defect-free polymer networks VL - 158 ER - TY - JOUR AB - We study turn-based stochastic zero-sum games with lexicographic preferences over objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as controllable and adversarial non-determinism. Lexicographic order allows one to consider multiple objectives with a strict preference order. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. For a mixture of reachability and safety objectives, we show that deterministic lexicographically optimal strategies exist and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP, matching the current known bound for single objectives; and in general the decision problem is PSPACE-hard and can be solved in NEXPTIME∩coNEXPTIME. We present an algorithm that computes the lexicographically optimal strategies via a reduction to the computation of optimal strategies in a sequence of single-objectives games. For omega-regular objectives, we restrict our analysis to one-player games, also known as Markov decision processes. We show that lexicographically optimal strategies exist and need either randomization or finite memory. We present an algorithm that solves the relevant decision problem in polynomial time. We have implemented our algorithms and report experimental results on various case studies. AU - Chatterjee, Krishnendu AU - Katoen, Joost P AU - Mohr, Stefanie AU - Weininger, Maximilian AU - Winkler, Tobias ID - 12738 JF - Formal Methods in System Design TI - Stochastic games with lexicographic objectives ER - TY - GEN AB - The zip file includes source data used in the manuscript "CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration", as well as a representative Jupyter notebook to reproduce the main figures. Please see the preprint on bioRxiv and the DOI link there to access the final published version. Note the title change between the preprint and the published manuscript. A sample script for particle-based simulations of collective chemotaxis by self-generated gradients is also included (see Self-generated_chemotaxis_sample_script.ipynb) to generate exemplary cell trajectories. A detailed description of the simulation setup is provided in the supplementary information of the manuscipt. AU - Ucar, Mehmet C ID - 14279 TI - Source data for the manuscript "CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration" ER - TY - JOUR AB - We consider large non-Hermitian random matrices X with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having 2+ϵ derivatives. Previously this result was known only for a few special cases; either the test functions were required to be analytic [72], or the distribution of the matrix elements needed to be Gaussian [73], or at least match the Gaussian up to the first four moments [82, 56]. We find the exact dependence of the limiting variance on the fourth cumulant that was not known before. The proof relies on two novel ingredients: (i) a local law for a product of two resolvents of the Hermitisation of X with different spectral parameters and (ii) a coupling of several weakly dependent Dyson Brownian motions. These methods are also the key inputs for our analogous results on the linear eigenvalue statistics of real matrices X that are presented in the companion paper [32]. AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 10405 IS - 5 JF - Communications on Pure and Applied Mathematics SN - 0010-3640 TI - Central limit theorem for linear eigenvalue statistics of non-Hermitian random matrices VL - 76 ER - TY - JOUR AB - Mathematical models often aim to describe a complicated mechanism in a cohesive and simple manner. However, reaching perfect balance between being simple enough or overly simplistic is a challenging task. Frequently, game-theoretic models have an underlying assumption that players, whenever they choose to execute a specific action, do so perfectly. In fact, it is rare that action execution perfectly coincides with intentions of individuals, giving rise to behavioural mistakes. The concept of incompetence of players was suggested to address this issue in game-theoretic settings. Under the assumption of incompetence, players have non-zero probabilities of executing a different strategy from the one they chose, leading to stochastic outcomes of the interactions. In this article, we survey results related to the concept of incompetence in classic as well as evolutionary game theory and provide several new results. We also suggest future extensions of the model and argue why it is important to take into account behavioural mistakes when analysing interactions among players in both economic and biological settings. AU - Graham, Thomas AU - Kleshnina, Maria AU - Filar, Jerzy A. ID - 10770 JF - Dynamic Games and Applications SN - 2153-0785 TI - Where do mistakes lead? A survey of games with incompetent players VL - 13 ER - TY - JOUR AB - We study direct integrals of quadratic and Dirichlet forms. We show that each quasi-regular Dirichlet space over a probability space admits a unique representation as a direct integral of irreducible Dirichlet spaces, quasi-regular for the same underlying topology. The same holds for each quasi-regular strongly local Dirichlet space over a metrizable Luzin σ-finite Radon measure space, and admitting carré du champ operator. In this case, the representation is only projectively unique. AU - Dello Schiavo, Lorenzo ID - 10145 JF - Potential Analysis SN - 0926-2601 TI - Ergodic decomposition of Dirichlet forms via direct integrals and applications VL - 58 ER - TY - JOUR AB - The study of RNAs has become one of the most influential research fields in contemporary biology and biomedicine. In the last few years, new sequencing technologies have produced an explosion of new and exciting discoveries in the field but have also given rise to many open questions. Defining these questions, together with old, long-standing gaps in our knowledge, is the spirit of this article. The breadth of topics within RNA biology research is vast, and every aspect of the biology of these molecules contains countless exciting open questions. Here, we asked 12 groups to discuss their most compelling question among some plant RNA biology topics. The following vignettes cover RNA alternative splicing; RNA dynamics; RNA translation; RNA structures; R-loops; epitranscriptomics; long non-coding RNAs; small RNA production and their functions in crops; small RNAs during gametogenesis and in cross-kingdom RNA interference; and RNA-directed DNA methylation. In each section, we will present the current state-of-the-art in plant RNA biology research before asking the questions that will surely motivate future discoveries in the field. We hope this article will spark a debate about the future perspective on RNA biology and provoke novel reflections in the reader. AU - Manavella, Pablo A AU - Godoy Herz, Micaela A AU - Kornblihtt, Alberto R AU - Sorenson, Reed AU - Sieburth, Leslie E AU - Nakaminami, Kentaro AU - Seki, Motoaki AU - Ding, Yiliang AU - Sun, Qianwen AU - Kang, Hunseung AU - Ariel, Federico D AU - Crespi, Martin AU - Giudicatti, Axel J AU - Cai, Qiang AU - Jin, Hailing AU - Feng, Xiaoqi AU - Qi, Yijun AU - Pikaard, Craig S ID - 12669 IS - 6 JF - The Plant Cell KW - Cell Biology KW - Plant Science SN - 1040-4651 TI - Beyond transcription: compelling open questions in plant RNA biology VL - 35 ER - TY - JOUR AB - We say that (Formula presented.) if, in every edge coloring (Formula presented.), we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy of (Formula presented.). The well-known states that the threshold for the property (Formula presented.) is equal to (Formula presented.), where (Formula presented.) is given by (Formula presented.) for any pair of graphs (Formula presented.) and (Formula presented.) with (Formula presented.). In this article, we show the 0-statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. AU - Liebenau, Anita AU - Mattos, Letícia AU - Mendonca Dos Santos, Walner AU - Skokan, Jozef ID - 11706 IS - 4 JF - Random Structures and Algorithms SN - 1042-9832 TI - Asymmetric Ramsey properties of random graphs involving cliques and cycles VL - 62 ER - TY - JOUR AB - We establish precise right-tail small deviation estimates for the largest eigenvalue of real symmetric and complex Hermitian matrices whose entries are independent random variables with uniformly bounded moments. The proof relies on a Green function comparison along a continuous interpolating matrix flow for a long time. Less precise estimates are also obtained in the left tail. AU - Erdös, László AU - Xu, Yuanyuan ID - 12707 IS - 2 JF - Bernoulli SN - 1350-7265 TI - Small deviation estimates for the largest eigenvalue of Wigner matrices VL - 29 ER - TY - JOUR AB - As developing tissues grow in size and undergo morphogenetic changes, their material properties may be altered. Such changes result from tension dynamics at cell contacts or cellular jamming. Yet, in many cases, the cellular mechanisms controlling the physical state of growing tissues are unclear. We found that at early developmental stages, the epithelium in the developing mouse spinal cord maintains both high junctional tension and high fluidity. This is achieved via a mechanism in which interkinetic nuclear movements generate cell area dynamics that drive extensive cell rearrangements. Over time, the cell proliferation rate declines, effectively solidifying the tissue. Thus, unlike well-studied jamming transitions, the solidification uncovered here resembles a glass transition that depends on the dynamical stresses generated by proliferation and differentiation. Our finding that the fluidity of developing epithelia is linked to interkinetic nuclear movements and the dynamics of growth is likely to be relevant to multiple developing tissues. AU - Bocanegra, Laura AU - Singh, Amrita AU - Hannezo, Edouard B AU - Zagórski, Marcin P AU - Kicheva, Anna ID - 12837 JF - Nature Physics SN - 1745-2473 TI - Cell cycle dynamics control fluidity of the developing mouse neuroepithelium VL - 19 ER - TY - THES AB - During development, tissues undergo changes in size and shape to form functional organs. Distinct cellular processes such as cell division and cell rearrangements underlie tissue morphogenesis. Yet how the distinct processes are controlled and coordinated, and how they contribute to morphogenesis is poorly understood. In our study, we addressed these questions using the developing mouse neural tube. This epithelial organ transforms from a flat epithelial sheet to an epithelial tube while increasing in size and undergoing morpho-gen-mediated patterning. The extent and mechanism of neural progenitor rearrangement within the developing mouse neuroepithelium is unknown. To investigate this, we per-formed high resolution lineage tracing analysis to quantify the extent of epithelial rear-rangement at different stages of neural tube development. We quantitatively described the relationship between apical cell size with cell cycle dependent interkinetic nuclear migra-tions (IKNM) and performed high cellular resolution live imaging of the neuroepithelium to study the dynamics of junctional remodeling. Furthermore, developed a vertex model of the neuroepithelium to investigate the quantitative contribution of cell proliferation, cell differentiation and mechanical properties to the epithelial rearrangement dynamics and validated the model predictions through functional experiments. Our analysis revealed that at early developmental stages, the apical cell area kinetics driven by IKNM induce high lev-els of cell rearrangements in a regime of high junctional tension and contractility. After E9.5, there is a sharp decline in the extent of cell rearrangements, suggesting that the epi-thelium transitions from a fluid-like to a solid-like state. We found that this transition is regulated by the growth rate of the tissue, rather than by changes in cell-cell adhesion and contractile forces. Overall, our study provides a quantitative description of the relationship between tissue growth, cell cycle dynamics, epithelia rearrangements and the emergent tissue material properties, and novel insights on how epithelial cell dynamics influences tissue morphogenesis. AU - Bocanegra, Laura ID - 13081 SN - 2663 - 337X TI - Epithelial dynamics during mouse neural tube development ER - TY - JOUR AB - In the present study, essential and nonessential metal content and biomarker responses were investigated in the intestine of fish collected from the areas polluted by mining. Our objective was to determine metal and biomarker levels in tissue responsible for dietary intake, which is rarely studied in water pollution research. The study was conducted in the Bregalnica River, reference location, and in the Zletovska and Kriva Rivers (the Republic of North Macedonia), which are directly influenced by the active mines Zletovo and Toranica, respectively. Biological responses were analyzed in Vardar chub (Squalius vardarensis; Karaman, 1928), using for the first time intestinal cytosol as a potentially toxic cell fraction, since metal sensitivity is mostly associated with cytosol. Cytosolic metal levels were higher in fish under the influence of mining (Tl, Li, Cs, Mo, Sr, Cd, Rb, and Cu in the Zletovska River and Cr, Pb, and Se in the Kriva River compared to the Bregalnica River in both seasons). The same trend was evident for total proteins, biomarkers of general stress, and metallothioneins, biomarkers of metal exposure, indicating cellular disturbances in the intestine, the primary site of dietary metal uptake. The association of cytosolic Cu and Cd at all locations pointed to similar pathways and homeostasis of these metallothionein-binding metals. Comparison with other indicator tissues showed that metal concentrations were higher in the intestine of fish from mining-affected areas than in the liver and gills. In general, these results indicated the importance of dietary metal pathways, and cytosolic metal fraction in assessing pollution impacts in freshwater ecosystems. AU - Filipović Marijić, Vlatka AU - Krasnici, Nesrete AU - Valić, Damir AU - Kapetanović, Damir AU - Vardić Smrzlić, Irena AU - Jordanova, Maja AU - Rebok, Katerina AU - Ramani, Sheriban AU - Kostov, Vasil AU - Nastova, Rodne AU - Dragun, Zrinka ID - 12863 JF - Environmental Science and Pollution Research SN - 0944-1344 TI - Pollution impact on metal and biomarker responses in intestinal cytosol of freshwater fish VL - 30 ER - TY - JOUR AB - Coherent control and manipulation of quantum degrees of freedom such as spins forms the basis of emerging quantum technologies. In this context, the robust valley degree of freedom and the associated valley pseudospin found in two-dimensional transition metal dichalcogenides is a highly attractive platform. Valley polarization and coherent superposition of valley states have been observed in these systems even up to room temperature. Control of valley coherence is an important building block for the implementation of valley qubit. Large magnetic fields or high-power lasers have been used in the past to demonstrate the control (initialization and rotation) of the valley coherent states. Here, the control of layer–valley coherence via strong coupling of valley excitons in bilayer WS2 to microcavity photons is demonstrated by exploiting the pseudomagnetic field arising in optical cavities owing to the transverse electric–transverse magnetic (TE–TM)mode splitting. The use of photonic structures to generate pseudomagnetic fields which can be used to manipulate exciton-polaritons presents an attractive approach to control optical responses without the need for large magnets or high-intensity optical pump powers. AU - Khatoniar, Mandeep AU - Yama, Nicholas AU - Ghazaryan, Areg AU - Guddala, Sriram AU - Ghaemi, Pouyan AU - Majumdar, Kausik AU - Menon, Vinod ID - 12836 IS - 13 JF - Advanced Optical Materials TI - Optical manipulation of Layer–Valley coherence via strong exciton–photon coupling in microcavities VL - 11 ER - TY - JOUR AB - This paper deals with the large-scale behaviour of dynamical optimal transport on Zd -periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes the effective behaviour of the discrete problems in terms of a continuous optimal transport problem. The effective energy density can be explicitly expressed in terms of a cell formula, which is a finite-dimensional convex programming problem that depends non-trivially on the local geometry of the discrete graph and the discrete energy density. Our homogenisation result is derived from a Γ -convergence result for action functionals on curves of measures, which we prove under very mild growth conditions on the energy density. We investigate the cell formula in several cases of interest, including finite-volume discretisations of the Wasserstein distance, where non-trivial limiting behaviour occurs. AU - Gladbach, Peter AU - Kopfer, Eva AU - Maas, Jan AU - Portinale, Lorenzo ID - 12959 IS - 5 JF - Calculus of Variations and Partial Differential Equations SN - 0944-2669 TI - Homogenisation of dynamical optimal transport on periodic graphs VL - 62 ER - TY - JOUR AB - Cu2–xS and Cu2–xSe have recently been reported as promising thermoelectric (TE) materials for medium-temperature applications. In contrast, Cu2–xTe, another member of the copper chalcogenide family, typically exhibits low Seebeck coefficients that limit its potential to achieve a superior thermoelectric figure of merit, zT, particularly in the low-temperature range where this material could be effective. To address this, we investigated the TE performance of Cu1.5–xTe–Cu2Se nanocomposites by consolidating surface-engineered Cu1.5Te nanocrystals. This surface engineering strategy allows for precise adjustment of Cu/Te ratios and results in a reversible phase transition at around 600 K in Cu1.5–xTe–Cu2Se nanocomposites, as systematically confirmed by in situ high-temperature X-ray diffraction combined with differential scanning calorimetry analysis. The phase transition leads to a conversion from metallic-like to semiconducting-like TE properties. Additionally, a layer of Cu2Se generated around Cu1.5–xTe nanoparticles effectively inhibits Cu1.5–xTe grain growth, minimizing thermal conductivity and decreasing hole concentration. These properties indicate that copper telluride based compounds have a promising thermoelectric potential, translated into a high dimensionless zT of 1.3 at 560 K. AU - Xing, Congcong AU - Zhang, Yu AU - Xiao, Ke AU - Han, Xu AU - Liu, Yu AU - Nan, Bingfei AU - Ramon, Maria Garcia AU - Lim, Khak Ho AU - Li, Junshan AU - Arbiol, Jordi AU - Poudel, Bed AU - Nozariasbmarz, Amin AU - Li, Wenjie AU - Ibáñez, Maria AU - Cabot, Andreu ID - 12915 IS - 9 JF - ACS Nano SN - 1936-0851 TI - Thermoelectric performance of surface-engineered Cu1.5–xTe–Cu2Se nanocomposites VL - 17 ER - TY - JOUR AB - Two notes separated by a doubling in frequency sound similar to humans. This “octave equivalence” is critical to perception and production of music and speech and occurs early in human development. Because it also occurs cross-culturally, a biological basis of octave equivalence has been hypothesized. Members of our team previousy suggested four human traits are at the root of this phenomenon: (1) vocal learning, (2) clear octave information in vocal harmonics, (3) differing vocal ranges, and (4) vocalizing together. Using cross-species studies, we can test how relevant these respective traits are, while controlling for enculturation effects and addressing questions of phylogeny. Common marmosets possess forms of three of the four traits, lacking differing vocal ranges. We tested 11 common marmosets by adapting an established head-turning paradigm, creating a parallel test to an important infant study. Unlike human infants, marmosets responded similarly to tones shifted by an octave or other intervals. Because previous studies with the same head-turning paradigm produced differential results to discernable acoustic stimuli in common marmosets, our results suggest that marmosets do not perceive octave equivalence. Our work suggests differing vocal ranges between adults and children and men and women and the way they are used in singing together may be critical to the development of octave equivalence. AU - Wagner, Bernhard AU - Šlipogor, Vedrana AU - Oh, Jinook AU - Varga, Marion AU - Hoeschele, Marisa ID - 12961 IS - 5 JF - Developmental Science SN - 1363-755X TI - A comparison between common marmosets (Callithrix jacchus) and human infants sheds light on traits proposed to be at the root of human octave equivalence VL - 26 ER - TY - JOUR AB - We consider billiards obtained by removing from the plane finitely many strictly convex analytic obstacles satisfying the non-eclipse condition. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift, which provides a natural labeling of periodic orbits. We show that under suitable symmetry and genericity assumptions, the Marked Length Spectrum determines the geometry of the billiard table. AU - De Simoi, Jacopo AU - Kaloshin, Vadim AU - Leguil, Martin ID - 12877 JF - Inventiones Mathematicae SN - 0020-9910 TI - Marked Length Spectral determination of analytic chaotic billiards with axial symmetries VL - 233 ER - TY - JOUR AB - Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. AU - Gupta, Divyansh AU - Mlynarski, Wiktor F AU - Sumser, Anton L AU - Symonova, Olga AU - Svaton, Jan AU - Jösch, Maximilian A ID - 12349 JF - Nature Neuroscience SN - 1097-6256 TI - Panoramic visual statistics shape retina-wide organization of receptive fields VL - 26 ER - TY - DATA AB - Statistics of natural scenes are not uniform - their structure varies dramatically from ground to sky. It remains unknown whether these non-uniformities are reflected in the large-scale organization of the early visual system and what benefits such adaptations would confer. Here, by relying on the efficient coding hypothesis, we predict that changes in the structure of receptive fields across visual space increase the efficiency of sensory coding. We show experimentally that, in agreement with our predictions, receptive fields of retinal ganglion cells change their shape along the dorsoventral retinal axis, with a marked surround asymmetry at the visual horizon. Our work demonstrates that, according to principles of efficient coding, the panoramic structure of natural scenes is exploited by the retina across space and cell-types. AU - Gupta, Divyansh AU - Sumser, Anton L AU - Jösch, Maximilian A ID - 12370 TI - Research Data for: Panoramic visual statistics shape retina-wide organization of receptive fields ER - TY - JOUR AB - The deployment of direct formate fuel cells (DFFCs) relies on the development of active and stable catalysts for the formate oxidation reaction (FOR). Palladium, providing effective full oxidation of formate to CO2, has been widely used as FOR catalyst, but it suffers from low stability, moderate activity, and high cost. Herein, we detail a colloidal synthesis route for the incorporation of P on Pd2Sn nanoparticles. These nanoparticles are dispersed on carbon black and the obtained composite is used as electrocatalytic material for the FOR. The Pd2Sn0.8P-based electrodes present outstanding catalytic activities with record mass current densities up to 10.0 A mgPd-1, well above those of Pd1.6Sn/C reference electrode. These high current densities are further enhanced by increasing the temperature from 25 °C to 40 °C. The Pd2Sn0.8P electrode also allows for slowing down the rapid current decay that generally happens during operation and can be rapidly re-activated through potential cycling. The excellent catalytic performance obtained is rationalized using density functional theory (DFT) calculations. AU - Montaña-Mora, Guillem AU - Qi, Xueqiang AU - Wang, Xiang AU - Chacón-Borrero, Jesus AU - Martinez-Alanis, Paulina R. AU - Yu, Xiaoting AU - Li, Junshan AU - Xue, Qian AU - Arbiol, Jordi AU - Ibáñez, Maria AU - Cabot, Andreu ID - 12829 JF - Journal of Electroanalytical Chemistry SN - 1572-6657 TI - Phosphorous incorporation into palladium tin nanoparticles for the electrocatalytic formate oxidation reaction VL - 936 ER - TY - JOUR AB - We study a new discretization of the Gaussian curvature for polyhedral surfaces. This discrete Gaussian curvature is defined on each conical singularity of a polyhedral surface as the quotient of the angle defect and the area of the Voronoi cell corresponding to the singularity. We divide polyhedral surfaces into discrete conformal classes using a generalization of discrete conformal equivalence pioneered by Feng Luo. We subsequently show that, in every discrete conformal class, there exists a polyhedral surface with constant discrete Gaussian curvature. We also provide explicit examples to demonstrate that this surface is in general not unique. AU - Kourimska, Hana ID - 12764 JF - Discrete and Computational Geometry SN - 0179-5376 TI - Discrete yamabe problem for polyhedral surfaces VL - 70 ER - TY - THES AB - The extension of extremal combinatorics to the setting of exterior algebra is a work in progress that gained attention recently. In this thesis, we study the combinatorial structure of exterior algebra by introducing a dictionary that translates the notions from the set systems into the framework of exterior algebra. We show both generalizations of celebrated Erdös--Ko--Rado theorem and Hilton--Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms. AU - Köse, Seyda ID - 13331 SN - 2791-4585 TI - Exterior algebra and combinatorics ER - TY - JOUR AB - Animals exhibit a variety of behavioural defences against socially transmitted parasites. These defences evolved to increase host fitness by avoiding, resisting or tolerating infection. Because they can occur in both infected individuals and their uninfected social partners, these defences often have important consequences for the social group. Here, we discuss the evolution and ecology of anti-parasite behavioural defences across a taxonomically wide social spectrum, considering colonial groups, stable groups, transitional groups and solitary animals. We discuss avoidance, resistance and tolerance behaviours across these social group structures, identifying how social complexity, group composition and interdependent social relationships may contribute to the expression and evolution of behavioural strategies. Finally, we outline avenues for further investigation such as approaches to quantify group-level responses, and the connection of the physiological and behavioural response to parasites in different social contexts. AU - Stockmaier, Sebastian AU - Ulrich, Yuko AU - Albery, Gregory F. AU - Cremer, Sylvia AU - Lopes, Patricia C. ID - 12765 IS - 4 JF - Functional Ecology SN - 0269-8463 TI - Behavioural defences against parasites across host social structures VL - 37 ER - TY - JOUR AB - The celebrated Erdős–Ko–Rado theorem about the maximal size of an intersecting family of r-element subsets of was extended to the setting of exterior algebra in [5, Theorem 2.3] and in [6, Theorem 1.4]. However, the equality case has not been settled yet. In this short note, we show that the extension of the Erdős–Ko–Rado theorem and the characterization of the equality case therein, as well as those of the Hilton–Milner theorem to the setting of exterior algebra in the simplest non-trivial case of two-forms follow from a folklore puzzle about possible arrangements of an intersecting family of lines. AU - Ivanov, Grigory AU - Köse, Seyda ID - 12680 IS - 6 JF - Discrete Mathematics SN - 0012-365X TI - Erdős-Ko-Rado and Hilton-Milner theorems for two-forms VL - 346 ER - TY - JOUR AB - In the physics literature the spectral form factor (SFF), the squared Fourier transform of the empirical eigenvalue density, is the most common tool to test universality for disordered quantum systems, yet previous mathematical results have been restricted only to two exactly solvable models (Forrester in J Stat Phys 183:33, 2021. https://doi.org/10.1007/s10955-021-02767-5, Commun Math Phys 387:215–235, 2021. https://doi.org/10.1007/s00220-021-04193-w). We rigorously prove the physics prediction on SFF up to an intermediate time scale for a large class of random matrices using a robust method, the multi-resolvent local laws. Beyond Wigner matrices we also consider the monoparametric ensemble and prove that universality of SFF can already be triggered by a single random parameter, supplementing the recently proven Wigner–Dyson universality (Cipolloni et al. in Probab Theory Relat Fields, 2021. https://doi.org/10.1007/s00440-022-01156-7) to larger spectral scales. Remarkably, extensive numerics indicates that our formulas correctly predict the SFF in the entire slope-dip-ramp regime, as customarily called in physics. AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 12792 JF - Communications in Mathematical Physics SN - 0010-3616 TI - On the spectral form factor for random matrices VL - 401 ER - TY - JOUR AB - Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. AU - Corbet, René AU - Kerber, Michael AU - Lesnick, Michael AU - Osang, Georg F ID - 12709 JF - Discrete and Computational Geometry SN - 0179-5376 TI - Computing the multicover bifiltration VL - 70 ER - TY - JOUR AB - Kleinjohann (Archiv der Mathematik 35(1):574–582, 1980; Mathematische Zeitschrift 176(3), 327–344, 1981) and Bangert (Archiv der Mathematik 38(1):54–57, 1982) extended the reach rch(S) from subsets S of Euclidean space to the reach rchM(S) of subsets S of Riemannian manifolds M, where M is smooth (we’ll assume at least C3). Bangert showed that sets of positive reach in Euclidean space and Riemannian manifolds are very similar. In this paper we introduce a slight variant of Kleinjohann’s and Bangert’s extension and quantify the similarity between sets of positive reach in Euclidean space and Riemannian manifolds in a new way: Given p∈M and q∈S, we bound the local feature size (a local version of the reach) of its lifting to the tangent space via the inverse exponential map (exp−1p(S)) at q, assuming that rchM(S) and the geodesic distance dM(p,q) are bounded. These bounds are motivated by the importance of the reach and local feature size to manifold learning, topological inference, and triangulating manifolds and the fact that intrinsic approaches circumvent the curse of dimensionality. AU - Boissonnat, Jean Daniel AU - Wintraecken, Mathijs ID - 12763 JF - Journal of Applied and Computational Topology SN - 2367-1726 TI - The reach of subsets of manifolds VL - 7 ER - TY - CONF AB - The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications. AU - Boker, Udi AU - Henzinger, Thomas A AU - Mazzocchi, Nicolas Adrien AU - Sarac, Naci E ID - 13221 SN - 9783959772990 T2 - 34th International Conference on Concurrency Theory TI - Safety and liveness of quantitative automata VL - 279 ER - TY - JOUR AB - Recently, a concept of generalized multifractality, which characterizes fluctuations and correlations of critical eigenstates, was introduced and explored for all 10 symmetry classes of disordered systems. Here, by using the nonlinear sigma-model ( NL σ M ) field theory, we extend the theory of generalized multifractality to boundaries of systems at criticality. Our numerical simulations on two-dimensional systems of symmetry classes A, C, and AII fully confirm the analytical predictions of pure-scaling observables and Weyl symmetry relations between critical exponents of surface generalized multifractality. This demonstrates the validity of the NL σ M for the description of Anderson-localization critical phenomena, not only in the bulk but also on the boundary. The critical exponents strongly violate generalized parabolicity, in analogy with earlier results for the bulk, corroborating the conclusion that the considered Anderson-localization critical points are not described by conformal field theories. We further derive relations between generalized surface multifractal spectra and linear combinations of Lyapunov exponents of a strip in quasi-one-dimensional geometry, which hold under the assumption of invariance with respect to a logarithmic conformal map. Our numerics demonstrate that these relations hold with an excellent accuracy. Taken together, our results indicate an intriguing situation: the conformal invariance is broken but holds partially at critical points of Anderson localization. AU - Babkin, Serafim AU - Karcher, Jonas F. AU - Burmistrov, Igor S. AU - Mirlin, Alexander D. ID - 14406 IS - 10 JF - Physical Review B SN - 2469-9950 TI - Generalized surface multifractality in two-dimensional disordered systems VL - 108 ER - TY - CONF AB - This paper focuses on the implementation details of the baseline methods and a recent lightweight conditional model extrapolation algorithm LIMES [5] for streaming data under class-prior shift. LIMES achieves superior performance over the baseline methods, especially concerning the minimum-across-day accuracy, which is important for the users of the system. In this work, the key measures to facilitate reproducibility and enhance the credibility of the results are described. AU - Tomaszewska, Paulina AU - Lampert, Christoph ID - 14410 SN - 0302-9743 T2 - International Workshop on Reproducible Research in Pattern Recognition TI - On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift VL - 14068 ER - TY - CONF AB - We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic formula specifies relations between sequences of variable values in different system executions. Unlike HyperLTL, hypernode logic takes an asynchronous view on execution traces by constraining the values and the order of value changes of each variable without correlating the timing of the changes. Different execution traces are synchronized solely through the transitions of hypernode automata. Hypernode automata naturally combine asynchronicity at the node level with synchronicity at the transition level. We show that the model-checking problem for hypernode automata is decidable over action-labeled Kripke structures, whose actions induce transitions of the specification automata. For this reason, hypernode automaton is a suitable formalism for specifying and verifying asynchronous hyperproperties, such as declassifying observational determinism in multi-threaded programs. AU - Bartocci, Ezio AU - Henzinger, Thomas A AU - Nickovic, Dejan AU - Oliveira da Costa, Ana ID - 14405 SN - 18688969 T2 - 34th International Conference on Concurrency Theory TI - Hypernode automata VL - 279 ER - TY - JOUR AB - We prove that the mesoscopic linear statistics ∑if(na(σi−z0)) of the eigenvalues {σi}i of large n×n non-Hermitian random matrices with complex centred i.i.d. entries are asymptotically Gaussian for any H20-functions f around any point z0 in the bulk of the spectrum on any mesoscopic scale 01+N−1/3+ϵ, for any ϵ>0. The study of this natural process combines elements of Hermitian and non-Hermitian analysis, and illustrates some aspects of the intrinsic instability of (even weakly) non-Hermitian matrices. AU - Dubach, Guillaume AU - Erdös, László ID - 12683 JF - Electronic Communications in Probability TI - Dynamics of a rank-one perturbation of a Hermitian matrix VL - 28 ER - TY - JOUR AB - We consider the fluctuations of regular functions f of a Wigner matrix W viewed as an entire matrix f (W). Going beyond the well-studied tracial mode, Trf (W), which is equivalent to the customary linear statistics of eigenvalues, we show that Trf (W)A is asymptotically normal for any nontrivial bounded deterministic matrix A. We identify three different and asymptotically independent modes of this fluctuation, corresponding to the tracial part, the traceless diagonal part and the off-diagonal part of f (W) in the entire mesoscopic regime, where we find that the off-diagonal modes fluctuate on a much smaller scale than the tracial mode. As a main motivation to study CLT in such generality on small mesoscopic scales, we determine the fluctuations in the eigenstate thermalization hypothesis (Phys. Rev. A 43 (1991) 2046–2049), that is, prove that the eigenfunction overlaps with any deterministic matrix are asymptotically Gaussian after a small spectral averaging. Finally, in the macroscopic regime our result also generalizes (Zh. Mat. Fiz. Anal. Geom. 9 (2013) 536–581, 611, 615) to complex W and to all crossover ensembles in between. The main technical inputs are the recent multiresolvent local laws with traceless deterministic matrices from the companion paper (Comm. Math. Phys. 388 (2021) 1005–1048). AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 12761 IS - 1 JF - Annals of Applied Probability SN - 1050-5164 TI - Functional central limit theorems for Wigner matrices VL - 33 ER - TY - JOUR AB - It is known that the Brauer--Manin obstruction to the Hasse principle is vacuous for smooth Fano hypersurfaces of dimension at least 3 over any number field. Moreover, for such varieties it follows from a general conjecture of Colliot-Thélène that the Brauer--Manin obstruction to the Hasse principle should be the only one, so that the Hasse principle is expected to hold. Working over the field of rational numbers and ordering Fano hypersurfaces of fixed degree and dimension by height, we prove that almost every such hypersurface satisfies the Hasse principle provided that the dimension is at least 3. This proves a conjecture of Poonen and Voloch in every case except for cubic surfaces. AU - Browning, Timothy D AU - Boudec, Pierre Le AU - Sawin, Will ID - 8682 IS - 3 JF - Annals of Mathematics SN - 0003-486X TI - The Hasse principle for random Fano hypersurfaces VL - 197 ER - TY - JOUR AB - Allometric settings of population dynamics models are appealing due to their parsimonious nature and broad utility when studying system level effects. Here, we parameterise the size-scaled Rosenzweig-MacArthur differential equations to eliminate prey-mass dependency, facilitating an in depth analytic study of the equations which incorporates scaling parameters’ contributions to coexistence. We define the functional response term to match empirical findings, and examine situations where metabolic theory derivations and observation diverge. The dynamical properties of the Rosenzweig-MacArthur system, encompassing the distribution of size-abundance equilibria, the scaling of period and amplitude of population cycling, and relationships between predator and prey abundances, are consistent with empirical observation. Our parameterisation is an accurate minimal model across 15+ orders of mass magnitude. AU - Mckerral, Jody C. AU - Kleshnina, Maria AU - Ejov, Vladimir AU - Bartle, Louise AU - Mitchell, James G. AU - Filar, Jerzy A. ID - 12706 IS - 2 JF - PLoS One TI - Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations VL - 18 ER - TY - JOUR AB - Phosphatidylinositol-4,5-bisphosphate (PI(4,5)P2) plays an essential role in neuronal activities through interaction with various proteins involved in signaling at membranes. However, the distribution pattern of PI(4,5)P2 and the association with these proteins on the neuronal cell membranes remain elusive. In this study, we established a method for visualizing PI(4,5)P2 by SDS-digested freeze-fracture replica labeling (SDS-FRL) to investigate the quantitative nanoscale distribution of PI(4,5)P2 in cryo-fixed brain. We demonstrate that PI(4,5)P2 forms tiny clusters with a mean size of ∼1000 nm2 rather than randomly distributed in cerebellar neuronal membranes in male C57BL/6J mice. These clusters show preferential accumulation in specific membrane compartments of different cell types, in particular, in Purkinje cell (PC) spines and granule cell (GC) presynaptic active zones. Furthermore, we revealed extensive association of PI(4,5)P2 with CaV2.1 and GIRK3 across different membrane compartments, whereas its association with mGluR1α was compartment specific. These results suggest that our SDS-FRL method provides valuable insights into the physiological functions of PI(4,5)P2 in neurons. AU - Eguchi, Kohgaku AU - Le Monnier, Elodie AU - Shigemoto, Ryuichi ID - 13202 IS - 23 JF - The Journal of Neuroscience SN - 0270-6474 TI - Nanoscale phosphoinositide distribution on cell membranes of mouse cerebellar neurons VL - 43 ER - TY - JOUR AB - We apply a variant of the square-sieve to produce an upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over P1 whose general fibre is a hyperelliptic curve. The implied constant does not depend on the coefficients of the polynomial defining the surface. AU - Bonolis, Dante AU - Browning, Timothy D ID - 12916 IS - 1 JF - Annali della Scuola Normale Superiore di Pisa - Classe di Scienze SN - 0391-173X TI - Uniform bounds for rational points on hyperelliptic fibrations VL - 24 ER - TY - THES AB - Animals exhibit a remarkable ability to learn and remember new behaviors, skills, and associations throughout their lifetime. These capabilities are made possible thanks to a variety of changes in the brain throughout adulthood, regrouped under the term "plasticity". Some cells in the brain —neurons— and specifically changes in the connections between neurons, the synapses, were shown to be crucial for the formation, selection, and consolidation of memories from past experiences. These ongoing changes of synapses across time are called synaptic plasticity. Understanding how a myriad of biochemical processes operating at individual synapses can somehow work in concert to give rise to meaningful changes in behavior is a fascinating problem and an active area of research. However, the experimental search for the precise plasticity mechanisms at play in the brain is daunting, as it is difficult to control and observe synapses during learning. Theoretical approaches have thus been the default method to probe the plasticity-behavior connection. Such studies attempt to extract unifying principles across synapses and model all observed synaptic changes using plasticity rules: equations that govern the evolution of synaptic strengths across time in neuronal network models. These rules can use many relevant quantities to determine the magnitude of synaptic changes, such as the precise timings of pre- and postsynaptic action potentials, the recent neuronal activity levels, the state of neighboring synapses, etc. However, analytical studies rely heavily on human intuition and are forced to make simplifying assumptions about plasticity rules. In this thesis, we aim to assist and augment human intuition in this search for plasticity rules. We explore whether a numerical approach could automatically discover the plasticity rules that elicit desired behaviors in large networks of interconnected neurons. This approach is dubbed meta-learning synaptic plasticity: learning plasticity rules which themselves will make neuronal networks learn how to solve a desired task. We first write all the potential plasticity mechanisms to consider using a single expression with adjustable parameters. We then optimize these plasticity parameters using evolutionary strategies or Bayesian inference on tasks known to involve synaptic plasticity, such as familiarity detection and network stabilization. We show that these automated approaches are powerful tools, able to complement established analytical methods. By comprehensively screening plasticity rules at all synapse types in realistic, spiking neuronal network models, we discover entire sets of degenerate plausible plasticity rules that reliably elicit memory-related behaviors. Our approaches allow for more robust experimental predictions, by abstracting out the idiosyncrasies of individual plasticity rules, and provide fresh insights on synaptic plasticity in spiking network models. AU - Confavreux, Basile J ID - 14422 SN - 2663 - 337X TI - Synapseek: Meta-learning synaptic plasticity rules ER - TY - THES AB - Superconductivity has many important applications ranging from levitating trains over qubits to MRI scanners. The phenomenon is successfully modeled by Bardeen-Cooper-Schrieffer (BCS) theory. From a mathematical perspective, BCS theory has been studied extensively for systems without boundary. However, little is known in the presence of boundaries. With the help of numerical methods physicists observed that the critical temperature may increase in the presence of a boundary. The goal of this thesis is to understand the influence of boundaries on the critical temperature in BCS theory and to give a first rigorous justification of these observations. On the way, we also study two-body Schrödinger operators on domains with boundaries and prove additional results for superconductors without boundary. BCS theory is based on a non-linear functional, where the minimizer indicates whether the system is superconducting or in the normal, non-superconducting state. By considering the Hessian of the BCS functional at the normal state, one can analyze whether the normal state is possibly a minimum of the BCS functional and estimate the critical temperature. The Hessian turns out to be a linear operator resembling a Schrödinger operator for two interacting particles, but with more complicated kinetic energy. As a first step, we study the two-body Schrödinger operator in the presence of boundaries. For Neumann boundary conditions, we prove that the addition of a boundary can create new eigenvalues, which correspond to the two particles forming a bound state close to the boundary. Second, we need to understand superconductivity in the translation invariant setting. While in three dimensions this has been extensively studied, there is no mathematical literature for the one and two dimensional cases. In dimensions one and two, we compute the weak coupling asymptotics of the critical temperature and the energy gap in the translation invariant setting. We also prove that their ratio is independent of the microscopic details of the model in the weak coupling limit; this property is referred to as universality. In the third part, we study the critical temperature of superconductors in the presence of boundaries. We start by considering the one-dimensional case of a half-line with contact interaction. Then, we generalize the results to generic interactions and half-spaces in one, two and three dimensions. Finally, we compare the critical temperature of a quarter space in two dimensions to the critical temperatures of a half-space and of the full space. AU - Roos, Barbara ID - 14374 SN - 2663 - 337X TI - Boundary superconductivity in BCS theory ER - TY - JOUR AB - We consider the linear BCS equation, determining the BCS critical temperature, in the presence of a boundary, where Dirichlet boundary conditions are imposed. In the one-dimensional case with point interactions, we prove that the critical temperature is strictly larger than the bulk value, at least at weak coupling. In particular, the Cooper-pair wave function localizes near the boundary, an effect that cannot be modeled by effective Neumann boundary conditions on the order parameter as often imposed in Ginzburg–Landau theory. We also show that the relative shift in critical temperature vanishes if the coupling constant either goes to zero or to infinity. AU - Hainzl, Christian AU - Roos, Barbara AU - Seiringer, Robert ID - 13207 IS - 4 JF - Journal of Spectral Theory SN - 1664-039X TI - Boundary superconductivity in the BCS model VL - 12 ER - TY - JOUR AB - The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√⁠. We illustrate our results with some numerical examples. AU - Barton, Nicholas H AU - Etheridge, Alison M. AU - Véber, Amandine ID - 14452 IS - 2 JF - Genetics SN - 0016-6731 TI - The infinitesimal model with dominance VL - 225 ER - TY - DATA AB - The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and a non-genetic (environmental) component and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the trait values of the parents. Although the trait distribution across the whole population can be far from normal, the trait distributions within families are normally distributed with a variance-covariance matrix that is determined entirely by that in the ancestral population and the probabilities of identity determined by the pedigree. Moreover, conditioning on some of the trait values within the pedigree has predictable effects on the mean and variance within and between families. In previous work, Barton et al. (2017), we showed that when trait values are determined by the sum of a large number of Mendelian factors, each of small effect, one can justify the infinitesimal model as limit of Mendelian inheritance. It was also shown that under some forms of epistasis, trait values within a family are still normally distributed. AU - Barton, Nicholas H ID - 12949 KW - Quantitative genetics KW - infinitesimal model TI - The infinitesimal model with dominance ER - TY - CONF AB - Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x. AU - Markov, Ilia AU - Vladu, Adrian AU - Guo, Qi AU - Alistarh, Dan-Adrian ID - 14461 T2 - Proceedings of the 40th International Conference on Machine Learning TI - Quantized distributed training of large models with convergence guarantees VL - 202 ER - TY - CONF AB - We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount . Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error. AU - Fichtenberger, Hendrik AU - Henzinger, Monika H AU - Upadhyay, Jalaj ID - 14462 T2 - Proceedings of the 40th International Conference on Machine Learning TI - Constant matters: Fine-grained error bound on differentially private continual observation VL - 202 ER - TY - CONF AB - Autoencoders are a popular model in many branches of machine learning and lossy data compression. However, their fundamental limits, the performance of gradient methods and the features learnt during optimization remain poorly understood, even in the two-layer setting. In fact, earlier work has considered either linear autoencoders or specific training regimes (leading to vanishing or diverging compression rates). Our paper addresses this gap by focusing on non-linear two-layer autoencoders trained in the challenging proportional regime in which the input dimension scales linearly with the size of the representation. Our results characterize the minimizers of the population risk, and show that such minimizers are achieved by gradient methods; their structure is also unveiled, thus leading to a concise description of the features obtained via training. For the special case of a sign activation function, our analysis establishes the fundamental limits for the lossy compression of Gaussian sources via (shallow) autoencoders. Finally, while the results are proved for Gaussian data, numerical simulations on standard datasets display the universality of the theoretical predictions. AU - Shevchenko, Aleksandr AU - Kögler, Kevin AU - Hassani, Hamed AU - Mondelli, Marco ID - 14459 T2 - Proceedings of the 40th International Conference on Machine Learning TI - Fundamental limits of two-layer autoencoders, and achieving them with gradient methods VL - 202 ER - TY - CONF AB - We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware. AU - Nikdan, Mahdi AU - Pegolotti, Tommaso AU - Iofinova, Eugenia B AU - Kurtic, Eldar AU - Alistarh, Dan-Adrian ID - 14460 T2 - Proceedings of the 40th International Conference on Machine Learning TI - SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge VL - 202 ER - TY - CONF AB - Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n). In this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2, such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise. AU - Hoffmann, Charlotte AU - Simkin, Mark ID - 14457 SN - 0302-9743 T2 - 8th International Conference on Cryptology and Information Security in Latin America TI - Stronger lower bounds for leakage-resilient secret sharing VL - 14168 ER - TY - CONF AB - We show for the first time that large-scale generative pretrained transformer (GPT) family models can be pruned to at least 50% sparsity in one-shot, without any retraining, at minimal loss of accuracy. This is achieved via a new pruning method called SparseGPT, specifically designed to work efficiently and accurately on massive GPT-family models. We can execute SparseGPT on the largest available open-source models, OPT-175B and BLOOM-176B, in under 4.5 hours, and can reach 60% unstructured sparsity with negligible increase in perplexity: remarkably, more than 100 billion weights from these models can be ignored at inference time. SparseGPT generalizes to semi-structured (2:4 and 4:8) patterns, and is compatible with weight quantization approaches. The code is available at: https://github.com/IST-DASLab/sparsegpt. AU - Frantar, Elias AU - Alistarh, Dan-Adrian ID - 14458 T2 - Proceedings of the 40th International Conference on Machine Learning TI - SparseGPT: Massive language models can be accurately pruned in one-shot VL - 202 ER - TY - JOUR AB - We investigate the potential of Multi-Objective, Deep Reinforcement Learning for stock and cryptocurrency single-asset trading: in particular, we consider a Multi-Objective algorithm which generalizes the reward functions and discount factor (i.e., these components are not specified a priori, but incorporated in the learning process). Firstly, using several important assets (BTCUSD, ETHUSDT, XRPUSDT, AAPL, SPY, NIFTY50), we verify the reward generalization property of the proposed Multi-Objective algorithm, and provide preliminary statistical evidence showing increased predictive stability over the corresponding Single-Objective strategy. Secondly, we show that the Multi-Objective algorithm has a clear edge over the corresponding Single-Objective strategy when the reward mechanism is sparse (i.e., when non-null feedback is infrequent over time). Finally, we discuss the generalization properties with respect to the discount factor. The entirety of our code is provided in open-source format. AU - Cornalba, Federico AU - Disselkamp, Constantin AU - Scassola, Davide AU - Helf, Christopher ID - 14451 JF - Neural Computing and Applications SN - 0941-0643 TI - Multi-objective reward generalization: improving performance of Deep Reinforcement Learning for applications in single-asset trading ER - TY - JOUR AB - In the presence of an obstacle, active particles condensate into a surface “wetting” layer due to persistent motion. If the obstacle is asymmetric, a rectification current arises in addition to wetting. Asymmetric geometries are therefore commonly used to concentrate microorganisms like bacteria and sperms. However, most studies neglect the fact that biological active matter is diverse, composed of individuals with distinct self-propulsions. Using simulations, we study a mixture of “fast” and “slow” active Brownian disks in two dimensions interacting with large half-disk obstacles. With this prototypical obstacle geometry, we analyze how the stationary collective behavior depends on the degree of self-propulsion “diversity,” defined as proportional to the difference between the self-propulsion speeds, while keeping the average self-propulsion speed fixed. A wetting layer rich in fast particles arises. The rectification current is amplified by speed diversity due to a superlinear dependence of rectification on self-propulsion speed, which arises from cooperative effects. Thus, the total rectification current cannot be obtained from an effective one-component active fluid with the same average self-propulsion speed, highlighting the importance of considering diversity in active matter. AU - Rojas Vega, Mauricio Nicolas AU - De Castro, Pablo AU - Soto, Rodrigo ID - 14442 IS - 10 JF - The European Physical Journal E SN - 1292-8941 TI - Mixtures of self-propelled particles interacting with asymmetric obstacles VL - 46 ER - TY - JOUR AB - We prove several results about substructures in Latin squares. First, we explain how to adapt our recent work on high-girth Steiner triple systems to the setting of Latin squares, resolving a conjecture of Linial that there exist Latin squares with arbitrarily high girth. As a consequence, we see that the number of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare) is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN , where N is the number of intercalates in a uniformly random order- n Latin square. In fact, extending recent work of Kwan, Sah, and Sawhney, we resolve the general large-deviation problem for intercalates in random Latin squares, up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2)) and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). Finally, as an application of some new general tools for studying substructures in random Latin squares, we show that in almost all order- n Latin squares, the number of cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices with the same arrangement of symbols) is of order n4, which is the minimum possible. As observed by Gowers and Long, this number can be interpreted as measuring ``how associative'' the quasigroup associated with the Latin square is. AU - Kwan, Matthew Alan AU - Sah, Ashwin AU - Sawhney, Mehtaab AU - Simkin, Michael ID - 14444 IS - 2 JF - Israel Journal of Mathematics SN - 0021-2172 TI - Substructures in Latin squares VL - 256 ER - TY - CONF AB - As AI and machine-learned software are used increasingly for making decisions that affect humans, it is imperative that they remain fair and unbiased in their decisions. To complement design-time bias mitigation measures, runtime verification techniques have been introduced recently to monitor the algorithmic fairness of deployed systems. Previous monitoring techniques assume full observability of the states of the (unknown) monitored system. Moreover, they can monitor only fairness properties that are specified as arithmetic expressions over the probabilities of different events. In this work, we extend fairness monitoring to systems modeled as partially observed Markov chains (POMC), and to specifications containing arithmetic expressions over the expected values of numerical functions on event sequences. The only assumptions we make are that the underlying POMC is aperiodic and starts in the stationary distribution, with a bound on its mixing time being known. These assumptions enable us to estimate a given property for the entire distribution of possible executions of the monitored POMC, by observing only a single execution. Our monitors observe a long run of the system and, after each new observation, output updated PAC-estimates of how fair or biased the system is. The monitors are computationally lightweight and, using a prototype implementation, we demonstrate their effectiveness on several real-world examples. AU - Henzinger, Thomas A AU - Kueffner, Konstantin AU - Mallik, Kaushik ID - 14454 SN - 0302-9743 T2 - 23rd International Conference on Runtime Verification TI - Monitoring algorithmic fairness under partial observations VL - 14245 ER - TY - JOUR AB - Recent work has paid close attention to the first principle of Granger causality, according to which cause precedes effect. In this context, the question may arise whether the detected direction of causality also reverses after the time reversal of unidirectionally coupled data. Recently, it has been shown that for unidirectionally causally connected autoregressive (AR) processes X → Y, after time reversal of data, the opposite causal direction Y → X is indeed detected, although typically as part of the bidirectional X↔ Y link. As we argue here, the answer is different when the measured data are not from AR processes but from linked deterministic systems. When the goal is the usual forward data analysis, cross-mapping-like approaches correctly detect X → Y, while Granger causality-like approaches, which should not be used for deterministic time series, detect causal independence X → Y. The results of backward causal analysis depend on the predictability of the reversed data. Unlike AR processes, observables from deterministic dynamical systems, even complex nonlinear ones, can be predicted well forward, while backward predictions can be difficult (notably when the time reversal of a function leads to one-to-many relations). To address this problem, we propose an approach based on models that provide multiple candidate predictions for the target, combined with a loss function that consideres only the best candidate. The resulting good forward and backward predictability supports the view that unidirectionally causally linked deterministic dynamical systems X → Y can be expected to detect the same link both before and after time reversal. AU - Jakubík, Jozef AU - Bui Thi Mai, Phuong AU - Chvosteková, Martina AU - Krakovská, Anna ID - 14446 IS - 4 JF - Measurement Science Review TI - Against the flow of time with multi-output models VL - 23 ER - TY - JOUR AB - Importance Climate change, pollution, urbanization, socioeconomic inequality, and psychosocial effects of the COVID-19 pandemic have caused massive changes in environmental conditions that affect brain health during the life span, both on a population level as well as on the level of the individual. How these environmental factors influence the brain, behavior, and mental illness is not well known. Observations A research strategy enabling population neuroscience to contribute to identify brain mechanisms underlying environment-related mental illness by leveraging innovative enrichment tools for data federation, geospatial observation, climate and pollution measures, digital health, and novel data integration techniques is described. This strategy can inform innovative treatments that target causal cognitive and molecular mechanisms of mental illness related to the environment. An example is presented of the environMENTAL Project that is leveraging federated cohort data of over 1.5 million European citizens and patients enriched with deep phenotyping data from large-scale behavioral neuroimaging cohorts to identify brain mechanisms related to environmental adversity underlying symptoms of depression, anxiety, stress, and substance misuse. Conclusions and Relevance This research will lead to the development of objective biomarkers and evidence-based interventions that will significantly improve outcomes of environment-related mental illness. AU - Schumann, Gunter AU - Andreassen, Ole A. AU - Banaschewski, Tobias AU - Calhoun, Vince D. AU - Clinton, Nicholas AU - Desrivieres, Sylvane AU - Brandlistuen, Ragnhild Eek AU - Feng, Jianfeng AU - Hese, Soeren AU - Hitchen, Esther AU - Hoffmann, Per AU - Jia, Tianye AU - Jirsa, Viktor AU - Marquand, Andre F. AU - Nees, Frauke AU - Nöthen, Markus M. AU - Novarino, Gaia AU - Polemiti, Elli AU - Ralser, Markus AU - Rapp, Michael AU - Schepanski, Kerstin AU - Schikowski, Tamara AU - Slater, Mel AU - Sommer, Peter AU - Stahl, Bernd Carsten AU - Thompson, Paul M. AU - Twardziok, Sven AU - Van Der Meer, Dennis AU - Walter, Henrik AU - Westlye, Lars ID - 14443 IS - 10 JF - JAMA Psychiatry TI - Addressing global environmental challenges to mental health using population neuroscience: A review VL - 80 ER -