@article{12288,
  abstract     = {To understand the function of neuronal circuits, it is crucial to disentangle the connectivity patterns within the network. However, most tools currently used to explore connectivity have low throughput, low selectivity, or limited accessibility. Here, we report the development of an improved packaging system for the production of the highly neurotropic RVdGenvA-CVS-N2c rabies viral vectors, yielding titers orders of magnitude higher with no background contamination, at a fraction of the production time, while preserving the efficiency of transsynaptic labeling. Along with the production pipeline, we developed suites of ‘starter’ AAV and bicistronic RVdG-CVS-N2c vectors, enabling retrograde labeling from a wide range of neuronal populations, tailored for diverse experimental requirements. We demonstrate the power and flexibility of the new system by uncovering hidden local and distal inhibitory connections in the mouse hippocampal formation and by imaging the functional properties of a cortical microcircuit across weeks. Our novel production pipeline provides a convenient approach to generate new rabies vectors, while our toolkit flexibly and efficiently expands the current capacity to label, manipulate and image the neuronal activity of interconnected neuronal circuits in vitro and in vivo.},
  author       = {Sumser, Anton L and Jösch, Maximilian A and Jonas, Peter M and Ben Simon, Yoav},
  issn         = {2050-084X},
  journal      = {eLife},
  keywords     = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Medicine, General Neuroscience},
  publisher    = {eLife Sciences Publications},
  title        = {{Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling}},
  doi          = {10.7554/elife.79848},
  volume       = {11},
  year         = {2022},
}

@article{12290,
  abstract     = {We prove local laws, i.e. optimal concentration estimates for arbitrary products of resolvents of a Wigner random matrix with deterministic matrices in between. We find that the size of such products heavily depends on whether some of the deterministic matrices are traceless. Our estimates correctly account for this dependence and they hold optimally down to the smallest possible spectral scale.},
  author       = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J},
  issn         = {1083-6489},
  journal      = {Electronic Journal of Probability},
  keywords     = {Statistics, Probability and Uncertainty, Statistics and Probability},
  pages        = {1--38},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Optimal multi-resolvent local laws for Wigner matrices}},
  doi          = {10.1214/22-ejp838},
  volume       = {27},
  year         = {2022},
}

@inproceedings{12298,
  abstract     = {Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the steady state, but sacrifice liveness during periods of asynchrony, or (2) they are robust (progress with probability one) but pay quadratic communication cost. We believe this trade-off is unwarranted since existing linear protocols still have asymptotic quadratic cost in the worst case. We design Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the steady state (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. We achieve this by replacing the view-synchronization of partially synchronous protocols with an asynchronous fallback mechanism at no extra asymptotic cost. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon, which leverages a quadratic view-change mechanism to reduce the latency of the standard 3-chain HotStuff. We implement and experimentally evaluate all our systems to prove that breaking the robustness-efficiency trade-off is in the realm of practicality.},
  author       = {Gelashvili, Rati and Kokoris Kogias, Eleftherios and Sonnino, Alberto and Spiegelman, Alexander and Xiang, Zhuolun},
  booktitle    = {Financial Cryptography and Data Security},
  isbn         = {9783031182822},
  issn         = {1611-3349},
  location     = {Radisson Grenada Beach Resort, Grenada},
  pages        = {296--315},
  publisher    = {Springer Nature},
  title        = {{Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback}},
  doi          = {10.1007/978-3-031-18283-9_14},
  volume       = {13411},
  year         = {2022},
}

@inproceedings{12300,
  abstract     = {Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t<n/3 malicious nodes and have an expected O(κn3) communication cost, where κ is the security parameter. Our ADKG protocol produces a field element as the secret and is thus compatible with off-the-shelf threshold cryptosystems. We implement our ADKG protocol and evaluate it using a network of up to 128 nodes in geographically distributed AWS instances. Our evaluation shows that our protocol takes as low as 3 and 9.5 seconds to terminate for 32 and 64 nodes, respectively. Also, each node sends only 0.7 Megabytes and 2.9 Megabytes of data during the two experiments, respectively.},
  author       = {Das, Sourav and Yurek, Thomas and Xiang, Zhuolun and Miller, Andrew and Kokoris Kogias, Eleftherios and Ren, Ling},
  booktitle    = {2022 IEEE Symposium on Security and Privacy},
  issn         = {2375-1207},
  location     = {San Francisco, CA, United States},
  pages        = {2518--2534},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Practical asynchronous distributed key generation}},
  doi          = {10.1109/sp46214.2022.9833584},
  year         = {2022},
}

@inproceedings{12302,
  abstract     = {We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called FORKLIFT, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870},
  author       = {Doveri, Kyveli and Ganty, Pierre and Mazzocchi, Nicolas Adrien},
  booktitle    = {Computer Aided Verification},
  isbn         = {9783031131875},
  issn         = {1611-3349},
  location     = {Haifa, Israel},
  pages        = {109--129},
  publisher    = {Springer Nature},
  title        = {{FORQ-based language inclusion formal testing}},
  doi          = {10.1007/978-3-031-13188-2_6},
  volume       = {13372},
  year         = {2022},
}

@inbook{12303,
  abstract     = {We construct for each choice of a quiver Q, a cohomology theory A, and a poset P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple groups and the loop Grassmannians of based quadratic forms. The addition of a “dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated by the program of introducing an inner cohomology theory in algebraic geometry adequate for the Geometric Langlands program (Mirković, Some extensions of the notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic quantum groups, preprint. arxiv1708.01418).},
  author       = {Mirković, Ivan and Yang, Yaping and Zhao, Gufang},
  booktitle    = {Representation Theory and Algebraic Geometry},
  editor       = {Baranovskky, Vladimir and Guay, Nicolas and Schedler, Travis},
  isbn         = {9783030820060},
  issn         = {2297-024X},
  pages        = {347--392},
  publisher    = {Springer Nature; Birkhäuser},
  title        = {{Loop Grassmannians of Quivers and Affine Quantum Groups}},
  doi          = {10.1007/978-3-030-82007-7_8},
  year         = {2022},
}

@article{12304,
  abstract     = {We establish sharp criteria for the instantaneous propagation of free boundaries in solutions to the thin-film equation. The criteria are formulated in terms of the initial distribution of mass (as opposed to previous almost-optimal results), reflecting the fact that mass is a locally conserved quantity for the thin-film equation. In the regime of weak slippage, our criteria are at the same time necessary and sufficient. The proof of our upper bounds on free boundary propagation is based on a strategy of “propagation of degeneracy” down to arbitrarily small spatial scales: We combine estimates on the local mass and estimates on energies to show that “degeneracy” on a certain space-time cylinder entails “degeneracy” on a spatially smaller space-time cylinder with the same time horizon. The derivation of our lower bounds on free boundary propagation is based on a combination of a monotone quantity and almost optimal estimates established previously by the second author with a new estimate connecting motion of mass to entropy production.},
  author       = {De Nitti, Nicola and Fischer, Julian L},
  issn         = {1532-4133},
  journal      = {Communications in Partial Differential Equations},
  keywords     = {Applied Mathematics, Analysis},
  number       = {7},
  pages        = {1394--1434},
  publisher    = {Taylor & Francis},
  title        = {{Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation}},
  doi          = {10.1080/03605302.2022.2056702},
  volume       = {47},
  year         = {2022},
}

@article{12305,
  abstract     = {This paper is concerned with the sharp interface limit for the Allen--Cahn equation with a nonlinear Robin boundary condition in a bounded smooth domain Ω⊂\R2. We assume that a diffuse interface already has developed and that it is in contact with the boundary ∂Ω. The boundary condition is designed in such a way that the limit problem is given by the mean curvature flow with constant α-contact angle. For α close to 90° we prove a local in time convergence result for well-prepared initial data for times when a smooth solution to the limit problem exists. Based on the latter we construct a suitable curvilinear coordinate system and carry out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear Robin boundary condition. Moreover, we show a spectral estimate for the corresponding linearized Allen--Cahn operator and with its aid we derive strong norm estimates for the difference of the exact and approximate solutions using a Gronwall-type argument.},
  author       = {Abels, Helmut and Moser, Maximilian},
  issn         = {1095-7154},
  journal      = {SIAM Journal on Mathematical Analysis},
  keywords     = {Applied Mathematics, Computational Mathematics, Analysis},
  number       = {1},
  pages        = {114--172},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°}},
  doi          = {10.1137/21m1424925},
  volume       = {54},
  year         = {2022},
}

@article{12307,
  abstract     = {Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences.},
  author       = {Shipman, Barbara A. and Stephenson, Elizabeth R},
  issn         = {1935-4053},
  journal      = {PRIMUS},
  keywords     = {Education, General Mathematics},
  number       = {5},
  pages        = {593--609},
  publisher    = {Taylor & Francis},
  title        = {{Tangible topology through the lens of limits}},
  doi          = {10.1080/10511970.2021.1872750},
  volume       = {32},
  year         = {2022},
}

@article{12332,
  abstract     = {Activity of sensory neurons is driven not only by external stimuli but also by feedback signals from higher brain areas. Attention is one particularly important internal signal whose presumed role is to modulate sensory representations such that they only encode information currently relevant to the organism at minimal cost. This hypothesis has, however, not yet been expressed in a normative computational framework. Here, by building on normative principles of probabilistic inference and efficient coding, we developed a model of dynamic population coding in the visual cortex. By continuously adapting the sensory code to changing demands of the perceptual observer, an attention-like modulation emerges. This modulation can dramatically reduce the amount of neural activity without deteriorating the accuracy of task-specific inferences. Our results suggest that a range of seemingly disparate cortical phenomena such as intrinsic gain modulation, attention-related tuning modulation, and response variability could be manifestations of the same underlying principles, which combine efficient sensory coding with optimal probabilistic inference in dynamic environments.},
  author       = {Mlynarski, Wiktor F and Tkačik, Gašper},
  issn         = {1545-7885},
  journal      = {PLoS Biology},
  number       = {12},
  pages        = {e3001889},
  publisher    = {Public Library of Science},
  title        = {{Efficient coding theory of dynamic attentional modulation}},
  doi          = {10.1371/journal.pbio.3001889},
  volume       = {20},
  year         = {2022},
}

@article{12333,
  abstract     = {Together, copy-number and point mutations form the basis for most evolutionary novelty, through the process of gene duplication and divergence. While a plethora of genomic data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic reporter system that can distinguish between copy-number and point mutations, we study their early and transient adaptive dynamics in real time in Escherichia coli. We find two qualitatively different routes of adaptation, depending on the level of functional improvement needed. In conditions of high gene expression demand, the two mutation types occur as a combination. However, under low gene expression demand, copy-number and point mutations are mutually exclusive; here, owing to their higher frequency, adaptation is dominated by copy-number mutations, in a process we term amplification hindrance. Ultimately, due to high reversal rates and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation, but also constrain sequence divergence over evolutionary time scales.},
  author       = {Tomanek, Isabella and Guet, Calin C},
  issn         = {2050-084X},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Adaptation dynamics between copynumber and point mutations}},
  doi          = {10.7554/ELIFE.82240},
  volume       = {11},
  year         = {2022},
}

@misc{12339,
  abstract     = {Copy-number and point mutations form the basis for most evolutionary novelty through the process of gene duplication and divergence. While a plethora of genomic sequence data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic system that allows us to distinguish copy-number and point mutations, we study their early and transient adaptive dynamics in real-time in Escherichia coli. We find two qualitatively different routes of adaptation depending on the level of functional improvement selected for: In conditions of high gene expression demand, the two types of mutations occur as a combination. Under low gene expression demand, negative epistasis between the two types of mutations renders them mutually exclusive. Thus, owing to their higher frequency, adaptation is dominated by copy-number mutations. Ultimately, due to high rates of reversal and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation but also constrain sequence divergence over evolutionary time scales.},
  author       = {Tomanek, Isabella and Guet, Calin C},
  publisher    = {Dryad},
  title        = {{Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose}},
  doi          = {10.5061/dryad.rfj6q57ds},
  year         = {2022},
}

@inproceedings{12432,
  abstract     = {We present CertifyHAM, a deterministic algorithm that takes a graph G as input and either finds a Hamilton cycle of G or outputs that such a cycle does not exist. If G ∼ G(n, p) and p ≥
100 log n/n then the expected running time of CertifyHAM is O(n/p) which is best possible. This improves upon previous results due to Gurevich and Shelah, Thomason and Alon, and
Krivelevich, who proved analogous results for p being constant, p ≥ 12n −1/3 and p ≥ 70n
−1/2 respectively.},
  author       = {Anastos, Michael},
  booktitle    = {63rd Annual IEEE Symposium on Foundations of Computer Science},
  isbn         = {9781665455190},
  issn         = {0272-5428},
  location     = {Denver, CO, United States},
  pages        = {919--930},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Solving the Hamilton cycle problem fast on average}},
  doi          = {10.1109/FOCS54457.2022.00091},
  volume       = {2022-October},
  year         = {2022},
}

@inproceedings{12452,
  abstract     = {Portrait viewpoint and illumination editing is an important problem with several applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry and illumination is critical for obtaining photorealistic results. Current methods are unable to explicitly model in 3D while handing both viewpoint and illumination editing from a single image. In this paper, we propose VoRF, a novel approach that can take even a single portrait image as input and relight human heads under novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents a human head as a continuous volumetric field and learns a prior model of human heads using a coordinate-based MLP with separate latent spaces for identity and illumination. The prior model is learnt in an auto-decoder manner over a diverse class of head shapes and appearances, allowing VoRF to generalize to novel test identities from a single input image. Additionally, VoRF has a reflectance MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time (OLAT) images under novel views. We synthesize novel illuminations by combining these OLAT images with target environment maps. Qualitative and quantitative evaluations demonstrate the effectiveness of VoRF for relighting and novel view synthesis even when applied to unseen subjects under uncontrolled illuminations.},
  author       = {Rao, Pramod and B R, Mallikarjun and Fox, Gereon and Weyrich, Tim and Bickel, Bernd and Seidel, Hans-Peter and Pfister, Hanspeter and Matusik, Wojciech and Tewari, Ayush and Theobalt, Christian and Elgharib, Mohamed},
  booktitle    = {33rd British Machine Vision Conference},
  location     = {London, United Kingdom},
  publisher    = {British Machine Vision Association and Society for Pattern Recognition},
  title        = {{VoRF: Volumetric Relightable Faces}},
  year         = {2022},
}

@article{12480,
  abstract     = {We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach.},
  author       = {Mondelli, Marco and Venkataramanan, Ramji},
  issn         = {1742-5468},
  journal      = {Journal of Statistical Mechanics: Theory and Experiment},
  keywords     = {Statistics, Probability and Uncertainty, Statistics and Probability, Statistical and Nonlinear Physics},
  number       = {11},
  publisher    = {IOP Publishing},
  title        = {{Approximate message passing with spectral initialization for generalized linear models}},
  doi          = {10.1088/1742-5468/ac9828},
  volume       = {2022},
  year         = {2022},
}

@article{12495,
  abstract     = {Fairness-aware learning aims at constructing classifiers that not only make accurate predictions, but also do not discriminate against specific groups. It is a fast-growing area of
machine learning with far-reaching societal impact. However, existing fair learning methods
are vulnerable to accidental or malicious artifacts in the training data, which can cause
them to unknowingly produce unfair classifiers. In this work we address the problem of
fair learning from unreliable training data in the robust multisource setting, where the
available training data comes from multiple sources, a fraction of which might not be representative of the true data distribution. We introduce FLEA, a filtering-based algorithm
that identifies and suppresses those data sources that would have a negative impact on
fairness or accuracy if they were used for training. As such, FLEA is not a replacement of
prior fairness-aware learning methods but rather an augmentation that makes any of them
robust against unreliable training data. We show the effectiveness of our approach by a
diverse range of experiments on multiple datasets. Additionally, we prove formally that
–given enough data– FLEA protects the learner against corruptions as long as the fraction of
affected data sources is less than half. Our source code and documentation are available at
https://github.com/ISTAustria-CVML/FLEA.},
  author       = {Iofinova, Eugenia B and Konstantinov, Nikola H and Lampert, Christoph},
  issn         = {2835-8856},
  journal      = {Transactions on Machine Learning Research},
  publisher    = {ML Research Press},
  title        = {{FLEA: Provably robust fair multisource learning from unreliable training data}},
  year         = {2022},
}

@inproceedings{12508,
  abstract     = {We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.
We show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.
For timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.
For the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states.},
  author       = {Henzinger, Thomas A and Lehtinen, Karoliina and Totzke, Patrick},
  booktitle    = {33rd International Conference on Concurrency Theory},
  isbn         = {9783959772464},
  issn         = {1868-8969},
  location     = {Warsaw, Poland},
  pages        = {14:1--14:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{History-deterministic timed automata}},
  doi          = {10.4230/LIPIcs.CONCUR.2022.14},
  volume       = {243},
  year         = {2022},
}

@inproceedings{12509,
  abstract     = {A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games.},
  author       = {Avni, Guy and Henzinger, Thomas A},
  booktitle    = {47th International Symposium on Mathematical Foundations of Computer Science},
  isbn         = {9783959772563},
  issn         = {1868-8969},
  location     = {Vienna, Austria},
  pages        = {3:1--3:6},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{An updated survey of bidding games on graphs}},
  doi          = {10.4230/LIPIcs.MFCS.2022.3},
  volume       = {241},
  year         = {2022},
}

@article{12510,
  abstract     = {We introduce a new statistical verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. Our algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability and up to a desired tightness.
 GoTube is implemented in JAX and optimized to scale to complex continuous-depth neural network models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube does not accumulate overapproximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability on a large set of experiments.
 GoTube is stable and sets the state-of-the-art in terms of its ability to scale to time horizons well beyond what has been previously possible.},
  author       = {Gruenbacher, Sophie A. and Lechner, Mathias and Hasani, Ramin and Rus, Daniela and Henzinger, Thomas A and Smolka, Scott A. and Grosu, Radu},
  isbn         = {978577358350},
  issn         = {2374-3468},
  journal      = {Proceedings of the AAAI Conference on Artificial Intelligence},
  keywords     = {General Medicine},
  number       = {6},
  pages        = {6755--6764},
  publisher    = {Association for the Advancement of Artificial Intelligence},
  title        = {{GoTube: Scalable statistical verification of continuous-depth models}},
  doi          = {10.1609/aaai.v36i6.20631},
  volume       = {36},
  year         = {2022},
}

@inproceedings{12516,
  abstract     = {The homogeneous continuous LWE (hCLWE) problem is to distinguish samples of a specific high-dimensional Gaussian mixture from standard normal samples. It was shown to be at least as hard as Learning with Errors, but no reduction in the other direction is currently known.
We present four new public-key encryption schemes based on the hardness of hCLWE, with varying tradeoffs between decryption and security errors, and different discretization techniques. Our schemes yield a polynomial-time algorithm for solving hCLWE using a Statistical Zero-Knowledge oracle.},
  author       = {Bogdanov, Andrej and Cueto Noval, Miguel and Hoffmann, Charlotte and Rosen, Alon},
  booktitle    = {Theory of Cryptography},
  isbn         = {9783031223648},
  issn         = {1611-3349},
  location     = {Chicago, IL, United States},
  pages        = {565--592},
  publisher    = {Springer Nature},
  title        = {{Public-Key Encryption from Homogeneous CLWE}},
  doi          = {10.1007/978-3-031-22365-5_20},
  volume       = {13748},
  year         = {2022},
}