@article{8539,
  abstract     = {Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions.},
  author       = {Su, C. and Zhao, Gufang and Zhong, C.},
  issn         = {0012-9593},
  journal      = {Annales Scientifiques de l'Ecole Normale Superieure},
  number       = {3},
  pages        = {663--671},
  publisher    = {Societe Mathematique de France},
  title        = {{On the K-theory stable bases of the springer resolution}},
  doi          = {10.24033/asens.2431},
  volume       = {53},
  year         = {2020},
}

@article{9781,
  abstract     = {We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers, and a quadratic lower bound in terms of the distance to the minimizer. The latter follows from nondegeneracy of the Hessian at the minimum.},
  author       = {Feliciangeli, Dario and Seiringer, Robert},
  issn         = {1095-7154},
  journal      = {SIAM Journal on Mathematical Analysis},
  keywords     = {Applied Mathematics, Computational Mathematics, Analysis},
  number       = {1},
  pages        = {605--622},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball}},
  doi          = {10.1137/19m126284x},
  volume       = {52},
  year         = {2020},
}

@phdthesis{8958,
  abstract     = {The oft-quoted dictum by Arthur Schawlow: ``A diatomic molecule has one atom too many'' has been disavowed. Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the rotation of coupled cold molecules in the presence of a many-body environment.
In this thesis, we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron - a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon - a quasiparticle formed out of a rotating molecule in a bosonic bath.
With this theoretical toolbox, we reveal the self-localization transition for the angulon quasiparticle. We show that, unlike for polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. 
For the system containing multiple impurities, by analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system from the strong-coupling regime to the weak molecule-bath interaction regime. We show that the molecules tend to have a strong alignment in the ground state, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. Finally, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules.},
  author       = {Li, Xiang},
  issn         = {2663-337X},
  pages        = {125},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Rotation of coupled cold molecules in the presence of a many-body environment}},
  doi          = {10.15479/AT:ISTA:8958},
  year         = {2020},
}

@inproceedings{15074,
  abstract     = {We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.},
  author       = {Brandt, Sebastian and Keller, Barbara and Rybicki, Joel and Suomela, Jukka and Uitto, Jara},
  booktitle    = {34th International Symposium on Distributed Computing},
  location     = {Virtual},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Brief announcement: Efficient load-balancing through distributed token dropping}},
  doi          = {10.4230/LIPIcs.DISC.2020.40},
  volume       = {179},
  year         = {2020},
}

@inproceedings{9415,
  abstract     = {Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. },
  author       = {Kurtz, Mark and Kopinsky, Justin and Gelashvili, Rati and Matveev, Alexander and Carr, John and Goin, Michael and Leiserson, William and Moore, Sage and Nell, Bill and Shavit, Nir and Alistarh, Dan-Adrian},
  booktitle    = {37th International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Online},
  pages        = {5533--5543},
  title        = {{Inducing and exploiting activation sparsity for fast neural network inference}},
  volume       = {119},
  year         = {2020},
}

@article{8285,
  abstract     = {We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200  μm radius and falls roughly 300  μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively.},
  author       = {Malia, Benjamin K. and Martínez-Rincón, Julián and Wu, Yunfan and Hosten, Onur and Kasevich, Mark A.},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit}},
  doi          = {10.1103/PhysRevLett.125.043202},
  volume       = {125},
  year         = {2020},
}

@article{8319,
  abstract     = {We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated.},
  author       = {Wu, Yunfan and Krishnakumar, Rajiv and Martínez-Rincón, Julián and Malia, Benjamin K. and Hosten, Onur and Kasevich, Mark A.},
  issn         = {2469-9934},
  journal      = {Physical Review A},
  number       = {1},
  publisher    = {American Physical Society},
  title        = {{Retrieval of cavity-generated atomic spin squeezing after free-space release}},
  doi          = {10.1103/PhysRevA.102.012224},
  volume       = {102},
  year         = {2020},
}

@article{8127,
  abstract     = {Mechanistic modeling in neuroscience aims to explain observed phenomena in terms of underlying causes. However, determining which model parameters agree with complex and stochastic neural data presents a significant challenge. We address this challenge with a machine learning tool which uses deep neural density estimators—trained using model simulations—to carry out Bayesian inference and retrieve the full space of parameters compatible with raw data or selected data features. Our method is scalable in parameters and data features and can rapidly analyze new data after initial training. We demonstrate the power and flexibility of our approach on receptive fields, ion channels, and Hodgkin–Huxley models. We also characterize the space of circuit configurations giving rise to rhythmic activity in the crustacean stomatogastric ganglion, and use these results to derive hypotheses for underlying compensation mechanisms. Our approach will help close the gap between data-driven and theory-driven models of neural dynamics.},
  author       = {Gonçalves, Pedro J. and Lueckmann, Jan-Matthis and Deistler, Michael and Nonnenmacher, Marcel and Öcal, Kaan and Bassetto, Giacomo and Chintaluri, Chaitanya and Podlaski, William F. and Haddad, Sara A. and Vogels, Tim P and Greenberg, David S. and Macke, Jakob H.},
  issn         = {2050-084X},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Training deep neural density estimators to identify mechanistic models of neural dynamics}},
  doi          = {10.7554/eLife.56261},
  volume       = {9},
  year         = {2020},
}

@article{7467,
  abstract     = {Nanomaterials produced from the bottom-up assembly of nanocrystals may incorporate ∼1020–1021 cm–3 not fully coordinated surface atoms, i.e., ∼1020–1021 cm–3 potential donor or acceptor states that can strongly affect transport properties. Therefore, to exploit the full potential of nanocrystal building blocks to produce functional nanomaterials and thin films, a proper control of their surface chemistry is required. Here, we analyze how the ligand stripping procedure influences the charge and heat transport properties of sintered PbSe nanomaterials produced from the bottom-up assembly of colloidal PbSe nanocrystals. First, we show that the removal of the native organic ligands by thermal decomposition in an inert atmosphere leaves relatively large amounts of carbon at the crystal interfaces. This carbon blocks crystal growth during consolidation and at the same time hampers charge and heat transport through the final nanomaterial. Second, we demonstrate that, by stripping ligands from the nanocrystal surface before consolidation, nanomaterials with larger crystal domains, lower porosity, and higher charge carrier concentrations are obtained, thus resulting in nanomaterials with higher electrical and thermal conductivities. In addition, the ligand displacement leaves the nanocrystal surface unprotected, facilitating oxidation and chalcogen evaporation. The influence of the ligand displacement on the nanomaterial charge transport properties is rationalized here using a two-band model based on the standard Boltzmann transport equation with the relaxation time approximation. Finally, we present an application of the produced functional nanomaterials by modeling, fabricating, and testing a simple PbSe-based thermoelectric device with a ring geometry.},
  author       = {Cadavid, Doris and Ortega, Silvia and Illera, Sergio and Liu, Yu and Ibáñez, Maria and Shavel, Alexey and Zhang, Yu and Li, Mengyao and López, Antonio M. and Noriega, Germán and Durá, Oscar Juan and López De La Torre, M. A. and Prades, Joan Daniel and Cabot, Andreu},
  issn         = {2574-0962},
  journal      = {ACS Applied Energy Materials},
  number       = {3},
  pages        = {2120--2129},
  publisher    = {American Chemical Society},
  title        = {{Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials}},
  doi          = {10.1021/acsaem.9b02137},
  volume       = {3},
  year         = {2020},
}

@phdthesis{8589,
  abstract     = {The plant hormone auxin plays indispensable roles in plant growth and development. An essential level of regulation in auxin action is the directional auxin transport within cells. The establishment of auxin gradient in plant tissue has been attributed to local auxin biosynthesis and directional intercellular auxin transport, which both are controlled by various environmental and developmental signals. It is well established that asymmetric auxin distribution in cells is achieved by polarly localized PIN-FORMED (PIN) auxin efflux transporters. Despite the initial insights into cellular mechanisms of PIN polarization obtained from the last decades, the molecular mechanism and specific regulators mediating PIN polarization remains elusive. In this thesis, we aim to find novel players in PIN subcellular polarity regulation during Arabidopsis development. We first characterize the physiological effect of piperonylic acid (PA) on Arabidopsis hypocotyl gravitropic bending and PIN polarization. Secondly, we reveal the importance of SCFTIR1/AFB auxin signaling pathway in shoot gravitropism bending termination. In addition, we also explore the role of myosin XI complex, and actin cytoskeleton in auxin feedback regulation on PIN polarity. In Chapter 1, we give an overview of the current knowledge about PIN-mediated auxin fluxes in various plant tropic responses. In Chapter 2, we study the physiological effect of PA on shoot gravitropic bending. Our results show that PA treatment inhibits auxin-mediated PIN3 repolarization by interfering with PINOID and PIN3 phosphorylation status, ultimately leading to hyperbending hypocotyls. In Chapter 3, we provide evidence to show that the SCFTIR1/AFB nuclear auxin signaling pathway is crucial and required for auxin-mediated PIN3 repolarization and shoot gravitropic bending termination. In Chapter 4, we perform a phosphoproteomics approach and identify the motor protein Myosin XI and its binding protein, the MadB2 family, as an essential regulator of PIN polarity for auxin-canalization related developmental processes. In Chapter 5, we demonstrate the vital role of actin cytoskeleton in auxin feedback on PIN polarity by regulating PIN subcellular trafficking. Overall, the data presented in this PhD thesis brings novel insights into the PIN polar localization regulation that resulted in the (re)establishment of the polar auxin flow and gradient in response to environmental stimuli during plant development.},
  author       = {Han, Huibin},
  issn         = {2663-337X},
  pages        = {164},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Novel insights into PIN polarity regulation during Arabidopsis development}},
  doi          = {10.15479/AT:ISTA:8589},
  year         = {2020},
}

@inproceedings{8322,
  abstract     = {Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.
In this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.
Our core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001).},
  author       = {Chakraborty, Suvradip and Dziembowski, Stefan and Nielsen, Jesper Buus},
  booktitle    = {Advances in Cryptology – CRYPTO 2020},
  isbn         = {9783030568795},
  issn         = {1611-3349},
  location     = {Santa Barbara, CA, United States},
  pages        = {732--762},
  publisher    = {Springer Nature},
  title        = {{Reverse firewalls for actively secure MPCs}},
  doi          = {10.1007/978-3-030-56880-1_26},
  volume       = {12171},
  year         = {2020},
}

@inproceedings{7636,
  abstract     = {Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.
In this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest.
We evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures.},
  author       = {Brown, Trevor A and Prokopec, Aleksandar and Alistarh, Dan-Adrian},
  booktitle    = {Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
  isbn         = {9781450368186},
  location     = {San Diego, CA, United States},
  pages        = {276--291},
  publisher    = {Association for Computing Machinery},
  title        = {{Non-blocking interpolation search trees with doubly-logarithmic running time}},
  doi          = {10.1145/3332466.3374542},
  year         = {2020},
}

@article{7472,
  abstract     = {Temporally organized reactivation of experiences during awake immobility periods is thought to underlie cognitive processes like planning and evaluation. While replay of trajectories is well established for the hippocampus, it is unclear whether the medial prefrontal cortex (mPFC) can reactivate sequential behavioral experiences in the awake state to support task execution. We simultaneously recorded from hippocampal and mPFC principal neurons in rats performing a mPFC-dependent rule-switching task on a plus maze. We found that mPFC neuronal activity encoded relative positions between the start and goal. During awake immobility periods, the mPFC replayed temporally organized sequences of these generalized positions, resembling entire spatial trajectories. The occurrence of mPFC trajectory replay positively correlated with rule-switching performance. However, hippocampal and mPFC trajectory replay occurred independently, indicating different functions. These results demonstrate that the mPFC can replay ordered activity patterns representing generalized locations and suggest that mPFC replay might have a role in flexible behavior.},
  author       = {Käfer, Karola and Nardin, Michele and Blahna, Karel and Csicsvari, Jozsef L},
  issn         = {0896-6273},
  journal      = {Neuron},
  number       = {1},
  pages        = {P154--165.e6},
  publisher    = {Elsevier},
  title        = {{Replay of behavioral sequences in the medial prefrontal cortex during rule switching}},
  doi          = {10.1016/j.neuron.2020.01.015},
  volume       = {106},
  year         = {2020},
}

@article{7643,
  author       = {Han, Huibin and Rakusova, Hana and Verstraeten, Inge and Zhang, Yuzhou and Friml, Jiří},
  issn         = {1532-2548},
  journal      = {Plant Physiology},
  number       = {5},
  pages        = {37--40},
  publisher    = {American Society of Plant Biologists},
  title        = {{SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism}},
  doi          = {10.1104/pp.20.00212},
  volume       = {183},
  year         = {2020},
}

@inproceedings{8382,
  abstract     = {We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.},
  author       = {Baig, Mirza Ahad and Hendler, Danny and Milani, Alessia and Travers, Corentin},
  booktitle    = {Proceedings of the 39th Symposium on Principles of Distributed Computing},
  isbn         = {9781450375825},
  location     = {Virtual, Italy},
  pages        = {31--40},
  publisher    = {Association for Computing Machinery},
  title        = {{Long-lived snapshots with polylogarithmic amortized step complexity}},
  doi          = {10.1145/3382734.3406005},
  year         = {2020},
}

@article{6952,
  abstract     = {We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn.},
  author       = {Henderson, Paul M and Ferrari, Vittorio},
  issn         = {1573-1405},
  journal      = {International Journal of Computer Vision},
  pages        = {835--854},
  publisher    = {Springer Nature},
  title        = {{Learning single-image 3D reconstruction by generative modelling of shape, pose and shading}},
  doi          = {10.1007/s11263-019-01219-8},
  volume       = {128},
  year         = {2020},
}

@article{8755,
  abstract     = {The superconducting circuit community has recently discovered the promising potential of superinductors. These circuit elements have a characteristic impedance exceeding the resistance quantum RQ ≈ 6.45 kΩ which leads to a suppression of ground state charge fluctuations. Applications include the realization of hardware protected qubits for fault tolerant quantum computing, improved coupling to small dipole moment objects and defining a new quantum metrology standard for the ampere. In this work we refute the widespread notion that superinductors can only be implemented based on kinetic inductance, i.e. using disordered superconductors or Josephson junction arrays. We present modeling, fabrication and characterization of 104 planar aluminum coil resonators with a characteristic impedance up to 30.9 kΩ at 5.6 GHz and a capacitance down to ≤ 1 fF, with lowloss and a power handling reaching 108 intra-cavity photons. Geometric superinductors are free of uncontrolled tunneling events and offer high reproducibility, linearity and the ability to couple magnetically - properties that significantly broaden the scope of future quantum circuits. },
  author       = {Peruzzo, Matilda and Trioni, Andrea and Hassani, Farid and Zemlicka, Martin and Fink, Johannes M},
  issn         = {2331-7019},
  journal      = {Physical Review Applied},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Surpassing the resistance quantum with a geometric superinductor}},
  doi          = {10.1103/PhysRevApplied.14.044055},
  volume       = {14},
  year         = {2020},
}

@article{6185,
  abstract     = {For complex Wigner-type matrices, i.e. Hermitian random matrices with independent, not necessarily identically distributed entries above the diagonal, we show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are universal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner–Dyson–Mehta universality conjecture for the last remaining universality type in the complex Hermitian class. Our analysis holds not only for exact cusps, but approximate cusps as well, where an extended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp for both symmetry classes. This result is also the key input in the companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where the cusp universality for real symmetric Wigner-type matrices is proven. The novel cusp fluctuation mechanism is also essential for the recent results on the spectral radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian edge universality (Cipolloni et al. in Edge universality for non-Hermitian random matrices, 2019. arXiv:1908.00969).},
  author       = {Erdös, László and Krüger, Torben H and Schröder, Dominik J},
  issn         = {1432-0916},
  journal      = {Communications in Mathematical Physics},
  pages        = {1203--1278},
  publisher    = {Springer Nature},
  title        = {{Cusp universality for random matrices I: Local law and the complex Hermitian case}},
  doi          = {10.1007/s00220-019-03657-4},
  volume       = {378},
  year         = {2020},
}

@article{6184,
  abstract     = {We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models.},
  author       = {Alt, Johannes and Erdös, László and Krüger, Torben H and Schröder, Dominik J},
  issn         = {0091-1798},
  journal      = {Annals of Probability},
  number       = {2},
  pages        = {963--1001},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Correlated random matrices: Band rigidity and edge universality}},
  doi          = {10.1214/19-AOP1379},
  volume       = {48},
  year         = {2020},
}

@inproceedings{7481,
  abstract     = {We address the following question:  How redundant is the parameterisation of ReLU networks? Specifically, we consider transformations of the weight space which leave the function implemented by the network intact.  Two such transformations are known for feed-forward architectures:  permutation of neurons within a layer, and positive scaling of all incoming weights of a neuron coupled with inverse scaling of its outgoing weights. In this work, we show for architectures with non-increasing widths that permutation and scaling are in fact the only function-preserving weight transformations.  For any eligible architecture we give an explicit construction of a neural network such that any other network that implements the same function can be obtained from the original one by the application of permutations and rescaling.  The proof relies on a geometric understanding of boundaries between linear regions of ReLU networks, and we hope the developed mathematical tools are of independent interest.},
  author       = {Bui Thi Mai, Phuong and Lampert, Christoph},
  booktitle    = {8th International Conference on Learning Representations},
  location     = {Online},
  title        = {{Functional vs. parametric equivalence of ReLU networks}},
  year         = {2020},
}