@article{17114,
  abstract     = {CRISPR-Cas are adaptive immune systems in bacteria and archaea that utilize CRISPR RNA-guided surveillance complexes to target complementary RNA or DNA for destruction<jats:sup>1–5</jats:sup>. Target RNA cleavage at regular intervals is characteristic of type III effector complexes<jats:sup>6–8</jats:sup>. Here, we determine the structures of the <jats:italic>Synechocystis</jats:italic> type III-Dv complex, an apparent evolutionary intermediate from multi-protein to single-protein type III effectors<jats:sup>9,10</jats:sup>, in pre- and post-cleavage states. The structures show how multi-subunit fusion proteins in the effector are tethered together in an unusual arrangement to assemble into an active and programmable RNA endonuclease and how the effector utilizes a distinct mechanism for target RNA seeding from other type III effectors. Using structural, biochemical, and quantum/classical molecular dynamics simulation, we study the structure and dynamics of the three catalytic sites, where a 2′-OH of the ribose on the target RNA acts as a nucleophile for in line self-cleavage of the upstream scissile phosphate. Strikingly, the arrangement at the catalytic residues of most type III complexes resembles the active site of ribozymes, including the hammerhead, pistol, and Varkud satellite ribozymes. Our work provides detailed molecular insight into the mechanisms of RNA targeting and cleavage by an important intermediate in the evolution of type III effector complexes.},
  author       = {Schwartz, Evan A. and Bravo, Jack Peter Kelly and Ahsan, Mohd and Macias, Luis A. and McCafferty, Caitlyn L. and Dangerfield, Tyler L. and Walker, Jada N. and Brodbelt, Jennifer S. and Palermo, Giulia and Fineran, Peter C. and Fagerlund, Robert D. and Taylor, David W.},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{RNA targeting and cleavage by the type III-Dv CRISPR effector complex}},
  doi          = {10.1038/s41467-024-47506-y},
  volume       = {15},
  year         = {2024},
}

@article{17122,
  abstract     = {Background: Motor alterations and lowered physical activity are common in affective disorders. Previous research has indicated a link between depressive symptoms and declining muscle strength primarily focusing on the elderly but not younger individuals. Thus, we aimed to evaluate the relationship between mood and muscle strength in a sample of N = 73 young to middle-aged hospitalized patients (18–49 years, mean age 30.7 years) diagnosed with major depressive, bipolar and schizoaffective disorder, with a focus on moderating effects of psychopharmacotherapy. The study was carried out as a prospective observational study at a German psychiatric university hospital between September 2021 and March 2022.
Methods: Employing a standardized strength circuit consisting of computerized strength training devices, we measured the maximal muscle strength (Fmax) using three repetitions maximum across four muscle regions (abdomen, arm, back, leg) at three time points (t1-t3) over four weeks accompanied by psychometric testing (MADRS, BPRS, YRMS) and blood lipid profiling in a clinical setting. For analysis of psychopharmacotherapy, medication was split into activating (AM) and inhibiting (IM) medication and dosages were normalized by the respective WHO defined daily dose.
Results: While we observed a significant decrease of the MADRS score and increase of the relative total Fmax (rTFmax) in the first two weeks (t1-t2) but not later (both p < .001), we did not reveal a significant bivariate correlation between disease severity (MADRS) and muscle strength (rTFmax) at any of the timepoints. Individuals with longer disease history displayed reduced rTFmax (p = .048). IM was significantly associated with decreased rTFmax (p = .032). Regression models provide a more substantial effect of gender, age, and IM on muscle strength than the depressive episode itself (p < .001).
Conclusions: The results of the study indicate that disease severity and muscle strength are not associated in young to middle-aged inpatients with affective disorders using a strength circuit as observational measurement. Future research will be needed to differentiate the effect of medication, gender, and age on muscle strength and to develop interventions for prevention of muscle weakness, especially in younger patients with chronic affective illnesses.},
  author       = {Ramming, Hannah and Theuerkauf, Linda and Hoos, Olaf and Lichter, Katharina and Kittel-Schneider, Sarah},
  issn         = {1471-244X},
  journal      = {BMC Psychiatry},
  publisher    = {Springer Nature},
  title        = {{The association between maximal muscle strength, disease severity and psychopharmacotherapy among young to middle-aged inpatients with affective disorders – a prospective pilot study}},
  doi          = {10.1186/s12888-024-05849-2},
  volume       = {24},
  year         = {2024},
}

@inproceedings{17139,
  author       = {Schlögl, Alois and Khalid, Waleed and Elefante, Stefano and Stadlbauer, Stephan},
  booktitle    = {ASHPC24 - Austrian-Slovenian HPC Meeting 2024},
  isbn         = {9783200096455},
  location     = {Grundlsee, Austria},
  pages        = {46},
  publisher    = {EuroCC Austria},
  title        = {{How much memory per CPU core is requested?}},
  doi          = {10.25365/phaidra.463},
  year         = {2024},
}

@article{18451,
  abstract     = {Inorganic nanoparticles can be assembled into superlattices with unique optical and magnetic properties arising from collective behavior. Protein cages can be utilized to guide this assembly by encapsulating nanoparticles and promoting their assembly into ordered structures. However, creating ordered multi-component structures with different protein cage types and sizes remains a challenge. Here, the co-crystallization of two different protein cages (cowpea chlorotic mottle virus and ferritin) characterized by opposing surface charges and unequal diameter is shown. Precise tuning of the electrostatic attraction between the cages enabled the preparation of binary crystals with dimensions up to several tens of micrometers. Additionally, binary metal nanoparticle superlattices are achieved by loading gold and iron oxide nanoparticles inside the cavities of the protein cages. The resulting structure adopts an AB2FCC configuration that also impacts the dipolar coupling between the particles and hence the optical properties of the crystals, providing key insight for the future preparation of plasmonic and magnetic nanoparticle metamaterials.},
  author       = {Zhou, Yu and Shaukat, Ahmed and Seitsonen, Jani and Rigoni, Carlo and Timonen, Jaakko V.I. and Kostiainen, Mauri A.},
  issn         = {2198-3844},
  journal      = {Advanced Science},
  number       = {45},
  publisher    = {Wiley},
  title        = {{Protein cage directed assembly of binary nanoparticle superlattices}},
  doi          = {10.1002/advs.202408416},
  volume       = {11},
  year         = {2024},
}

@article{18545,
  abstract     = {Clinical implementation of therapeutic genome editing relies on efficient in vivo delivery and the safety of CRISPR-Cas tools. Previously, we identified PsCas9 as a Type II-B family enzyme capable of editing mouse liver genome upon adenoviral delivery without detectable off-targets and reduced chromosomal translocations. Yet, its efficacy remains insufficient with non-viral delivery, a common challenge for many Cas9 orthologues. Here, we sought to redesign PsCas9 for in vivo editing using lipid nanoparticles. We solve the PsCas9 ribonucleoprotein structure with cryo-EM and characterize it biochemically, providing a basis for its rational engineering. Screening over numerous guide RNA and protein variants lead us to develop engineered PsCas9 (ePsCas9) with up to 20-fold increased activity across various targets and preserved safety advantages. We apply the same design principles to boost the activity of FnCas9, an enzyme phylogenetically relevant to PsCas9. Remarkably, a single administration of mRNA encoding ePsCas9 and its guide formulated with lipid nanoparticles results in high levels of editing in the Pcsk9 gene in mouse liver, a clinically relevant target for hypercholesterolemia treatment. Collectively, our findings introduce ePsCas9 as a highly efficient, and precise tool for therapeutic genome editing, in addition to the engineering strategy applicable to other Cas9 orthologues.},
  author       = {Degtev, Dmitrii and Bravo, Jack Peter Kelly and Emmanouilidi, Aikaterini and Zdravković, Aleksandar and Choong, Oi Kuan and Liz Touza, Julia and Selfjord, Niklas and Weisheit, Isabel and Francescatto, Margherita and Akcakaya, Pinar and Porritt, Michelle and Maresca, Marcello and Taylor, David and Sienski, Grzegorz},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{Engineered PsCas9 enables therapeutic genome editing in mouse liver with lipid nanoparticles}},
  doi          = {10.1038/s41467-024-53418-8},
  volume       = {15},
  year         = {2024},
}

@misc{18579,
  abstract     = {Electrophysiological, calcium two-photon recordings and behavioral data for Vega-Zuniga et al.  Relevant information can be found in the 'README.txt' files. },
  author       = {Vega Zuniga, Tomas A and Sumser, Anton L and Symonova, Olga and Koppensteiner, Peter and Schmidt, Florian and Jösch, Maximilian A},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{A thalamic hub-and-spoke network enables visual perception during action by coordinating visuomotor dynamics}},
  doi          = {10.15479/AT:ISTA:18579},
  year         = {2024},
}

@article{18645,
  abstract     = {Gene expression during natural and induced reprogramming is controlled by pioneer transcription factors that initiate transcription from closed chromatin. Nr5a2 is a key pioneer factor that regulates zygotic genome activation in totipotent embryos, pluripotency in embryonic stem cells and metabolism in adult tissues, but the mechanism of its pioneer activity remains poorly understood. Here, we present a cryo-electron microscopy structure of human NR5A2 bound to a nucleosome. The structure shows that the conserved carboxy-terminal extension (CTE) loop of the NR5A2 DNA-binding domain competes with a DNA minor groove anchor of the nucleosome and releases entry-exit site DNA. Mutational analysis showed that NR5A2 D159 of the CTE is dispensable for DNA binding but required for stable nucleosome association and persistent DNA ‘unwrapping’. These findings suggest that NR5A2 belongs to an emerging class of pioneer factors that can use DNA minor groove anchor competition to destabilize nucleosomes and facilitate gene expression during reprogramming.},
  author       = {Kobayashi, Wataru and Sappler, Anna H. and Bollschweiler, Daniel and Kümmecke, Maximilian and Basquin, Jérôme and Arslantas, Eda Nur and Ruangroengkulrith, Siwat and Hornberger, Renate and Duderstadt, Karl and Tachibana, Kikuë},
  issn         = {1545-9985},
  journal      = {Nature Structural & Molecular Biology},
  pages        = {757--766},
  publisher    = {Springer Nature},
  title        = {{Nucleosome-bound NR5A2 structure reveals pioneer factor mechanism by DNA minor groove anchor competition}},
  doi          = {10.1038/s41594-024-01239-0},
  volume       = {31},
  year         = {2024},
}

@inproceedings{18756,
  abstract     = {The evasive LWE assumption, proposed by Wee [Eurocrypt’22 Wee] for constructing a lattice-based optimal broadcast encryption, has shown to be a powerful assumption, adopted by subsequent works to construct advanced primitives ranging from ABE variants to obfuscation for null circuits. However, a closer look reveals significant differences among the precise assumption statements involved in different works, leading to the fundamental question of how these assumptions compare to each other. In this work, we initiate a more systematic study on evasive LWE assumptions:
(i) Based on the standard LWE assumption, we construct simple counterexamples against three private-coin evasive LWE variants, used in [Crypto’22 Tsabary, Asiacrypt’22 VWW, Crypto’23 ARYY] respectively, showing that these assumptions are unlikely to hold.

(ii) Based on existing evasive LWE variants and our counterexamples, we propose and define three classes of plausible evasive LWE assumptions, suitably capturing all existing variants for which we are not aware of non-obfuscation-based counterexamples.

(iii) We show that under our assumption formulations, the security proofs of [Asiacrypt’22 VWW] and [Crypto’23 ARYY] can be recovered, and we reason why the security proof of [Crypto’22 Tsabary] is also plausibly repairable using an appropriate evasive LWE assumption.},
  author       = {Brzuska, Chris and Ünal, Akin and Woo, Ivy K.Y.},
  booktitle    = {30th International Conference on the Theory and Application of Cryptology and Information Security},
  isbn         = {9789819608935},
  issn         = {1611-3349},
  location     = {Kolkata, India},
  pages        = {418--449},
  publisher    = {Springer Nature},
  title        = {{Evasive LWE assumptions: Definitions, classes, and counterexamples}},
  doi          = {10.1007/978-981-96-0894-2_14},
  volume       = {15487},
  year         = {2024},
}

@article{18867,
  abstract     = {In an accreting X-ray pulsar, a neutron star accretes matter from a companion star through an accretion disk. The magnetic field of the rotating neutron star disrupts the inner edge of the disk, funnelling the gas to flow onto the poles on its surface. Hercules X-1 is a prototypical persistent X-ray pulsar about 7 kpc from Earth. Its emission varies on three distinct timescales: the neutron star rotates every 1.2 s, it is eclipsed by its companion each 1.7 d, and the system exhibits a superorbital period of 35 d, which has remained stable since its discovery. Several lines of evidence point to the source of this variation as the precession of the accretion disk or that of the neutron star. Despite the many hints over the past 50 yr, the precession of the neutron star itself has yet not been confirmed or refuted. X-ray polarization measurements (probing the spin geometry of Her X-1) with the Imaging X-ray Polarimetry Explorer suggest that free precession of the neutron star crust sets the 35 d period; this has the important implication that its crust is somewhat asymmetric by a few parts per ten million.},
  author       = {Heyl, Jeremy and Doroshenko, Victor and González-Caniulef, Denis and Caiazzo, Ilaria and Poutanen, Juri and Mushtukov, Alexander and Tsygankov, Sergey S. and Kirmizibayrak, Demet and Bachetti, Matteo and Pavlov, George G. and Forsblom, Sofia V. and Malacaria, Christian and Suleimanov, Valery F. and Agudo, Iván and Antonelli, Lucio Angelo and Baldini, Luca and Baumgartner, Wayne H. and Bellazzini, Ronaldo and Bianchi, Stefano and Bongiorno, Stephen D. and Bonino, Raffaella and Brez, Alessandro and Bucciantini, Niccolò and Capitanio, Fiamma and Castellano, Simone and Cavazzuti, Elisabetta and Chen, Chien-Ting and Ciprini, Stefano and Costa, Enrico and De Rosa, Alessandra and Del Monte, Ettore and Di Gesu, Laura and Di Lalla, Niccolò and Di Marco, Alessandro and Donnarumma, Immacolata and Dovčiak, Michal and Ehlert, Steven R. and Enoto, Teruaki and Evangelista, Yuri and Fabiani, Sergio and Ferrazzoli, Riccardo and Garcia, Javier A. and Gunji, Shuichi and Hayashida, Kiyoshi and Iwakiri, Wataru and Jorstad, Svetlana G. and Kaaret, Philip and Karas, Vladimir and Kislat, Fabian and Kitaguchi, Takao and Kolodziejczak, Jeffery J. and Krawczynski, Henric and La Monaca, Fabio and Latronico, Luca and Liodakis, Ioannis and Maldera, Simone and Manfreda, Alberto and Marin, Frédéric and Marinucci, Andrea and Marscher, Alan P. and Marshall, Herman L. and Massaro, Francesco and Matt, Giorgio and Mitsuishi, Ikuyuki and Mizuno, Tsunefumi and Muleri, Fabio and Negro, Michela and Ng, C.-Y. and O’Dell, Stephen L. and Omodei, Nicola and Oppedisano, Chiara and Papitto, Alessandro and Peirson, Abel Lawrence and Perri, Matteo and Pesce-Rollins, Melissa and Petrucci, Pierre-Olivier and Pilia, Maura and Possenti, Andrea and Puccetti, Simonetta and Ramsey, Brian D. and Rankin, John and Ratheesh, Ajay and Roberts, Oliver J. and Romani, Roger W. and Sgrò, Carmelo and Slane, Patrick and Soffitta, Paolo and Spandre, Gloria and Swartz, Douglas A. and Tamagawa, Toru and Tavecchio, Fabrizio and Taverna, Roberto and Tawara, Yuzuru and Tennant, Allyn F. and Thomas, Nicholas E. and Tombesi, Francesco and Trois, Alessio and Turolla, Roberto and Vink, Jacco and Weisskopf, Martin C. and Wu, Kinwah and Xie, Fei and Zane, Silvia},
  issn         = {2397-3366},
  journal      = {Nature Astronomy},
  pages        = {1047--1053},
  publisher    = {Springer Nature},
  title        = {{Complex rotational dynamics of the neutron star in Hercules X-1 revealed by X-ray polarization}},
  doi          = {10.1038/s41550-024-02295-8},
  volume       = {8},
  year         = {2024},
}

@article{18868,
  abstract     = {We develop two new highly efficient estimators to measure the polarization (Stokes parameters) in experiments that constrain the position angle of individual photons such as scattering and gas-pixel-detector polarimeters, and analyse in detail a previously proposed estimator. All three of these estimators are at least fifty percent more efficient on typical datasets than the standard estimator used in the field. We present analytic estimates of the variance of these estimators and numerical experiments to verify these estimates. Two of the three estimators can be calculated quickly and directly through summations over the measurements of individual photons.},
  author       = {Heyl, Jeremy and González-Caniulef, Denis and Caiazzo, Ilaria},
  issn         = {2565-6120},
  journal      = {The Open Journal of Astrophysics},
  publisher    = {Maynooth Academic Publishing},
  title        = {{Optimal summary statistics for X-ray polarization}},
  doi          = {10.33232/001c.117476},
  volume       = {7},
  year         = {2024},
}

@inproceedings{18998,
  abstract     = {Word embeddings represent language vocabularies as clouds of d-dimensional points. We investigate how information is conveyed by the general shape of these clouds, instead of representing the semantic meaning of each token. Specifically, we use the notion of persistent homology from topological data analysis (TDA) to measure the distances between language pairs from the shape of their unlabeled embeddings. These distances quantify the degree of non-isometry of the embeddings. To distinguish whether these differences are random training errors or capture real information about the languages, we use the computed distance matrices to construct language phylogenetic trees over 81 Indo-European languages. Careful evaluation shows that our reconstructed trees exhibit strong and statistically-significant similarities to the reference.},
  author       = {Draganov, Ondrej and Skiena, Steven},
  booktitle    = {Findings of the Association for Computational Linguistics: EMNLP 2024},
  location     = {Miami, FL, United States},
  pages        = {12080--12099},
  publisher    = {Association for Computational Linguistics},
  title        = {{The shape of word embeddings: Quantifying non-isometry with topological data analysis}},
  doi          = {10.18653/v1/2024.findings-emnlp.705},
  year         = {2024},
}

@unpublished{18999,
  abstract     = {Exploring the shape of point configurations has been a key driver in the evolution of TDA (short for topological data analysis) since its infancy. This survey illustrates the recent efforts to broaden these ideas to model spatial interactions among multiple configurations, each distinguished by a color. It describes advances in this area and prepares the ground for further exploration by mentioning unresolved questions and promising research avenues while focusing on the overlap with discrete geometry.},
  author       = {Cultrera di Montesano, Sebastiano and Draganov, Ondrej and Edelsbrunner, Herbert and Saghafian, Morteza},
  booktitle    = {arXiv},
  title        = {{Chromatic topological data analysis}},
  doi          = {10.48550/ARXIV.2406.04102},
  year         = {2024},
}

@inproceedings{19028,
  abstract     = {The stochastic nature of modern Monte Carlo (MC) rendering methods inevitably produces noise in rendered images for a practical number of samples per pixel. The problem of denoising these images has been widely studied, with most recent methods relying on data-driven, pretrained neural networks. In contrast, in this paper we propose a statistical approach to the denoising problem, treating each pixel as a random variable and reasoning about its distribution. Considering a pixel of the noisy rendered image, we formulate fast pair-wise statistical tests—based on online estimators—to decide which of the nearby pixels to exclude from the denoising filter. We show that for symmetric pixel weights and normally distributed samples, the classical Welch t-test is optimal in terms of mean squared error. We then show how to extend this result to handle non-normal distributions, using more recent confidence-interval formulations in combination with the Box-Cox transformation. Our results show that our statistical denoising approach matches the performance of state-of-the-art neural image denoising without having to resort to any computation-intensive pretraining. Furthermore, our approach easily generalizes to other quantities besides pixel intensity, which we demonstrate by showing additional applications to Russian roulette path termination and multiple importance sampling.},
  author       = {Sakai, Hiroyuki and Freude, Christian and Auzinger, Thomas and Hahn, David and Wimmer, Michael},
  booktitle    = {Proceedings - SIGGRAPH Asia 2024 Conference Papers},
  isbn         = {9798400711312},
  location     = {Tokyo, Japan},
  publisher    = {Association for Computing Machinery},
  title        = {{A statistical approach to Monte Carlo denoising}},
  doi          = {10.1145/3680528.3687591},
  year         = {2024},
}

@article{19408,
  abstract     = {Continual learning is a subfield of machine learning, which aims to allow machine learning models to continuously learn on new data, by accumulating knowledge without forgetting what was learned in the past. In this work, we take a step back, and ask: "Why should one care about continual learning in the first place?". We set the stage by examining recent continual learning papers published at four major machine learning conferences, and show that memory-constrained settings dominate the field. Then, we discuss five open problems in machine learning, and even though they might seem unrelated to continual learning at first sight, we show that continual learning will inevitably be part of their solution. These problems are model editing, personalization and specialization, on-device learning, faster (re-)training and reinforcement learning. Finally, by comparing the desiderata from these unsolved problems and the current assumptions in continual learning, we highlight and discuss four future directions for continual learning research. We hope that this work offers an interesting perspective on the future of continual learning, while displaying its potential value and the paths we have to pursue in order to make it successful. This work is the result of the many discussions the authors had at the Dagstuhl seminar on Deep Continual Learning, in March 2023.},
  author       = {Verwimp, Eli and Aljundi, Rahaf and Ben-David, Shai and Bethge, Matthias and Cossu, Andrea and Gepperth, Alexander and Hayes, Tyler L. and Hüllermeier, Eyke and Kanan, Christopher and Kudithipudi, Dhireesha and Lampert, Christoph and Mundt, Martin and Pascanu, Razvan and Popescu, Adrian and Tolias, Andreas S. and Van De Weijer, Joost and Liu, Bing and Lomonaco, Vincenzo and Tuytelaars, Tinne and Van De Ven, Gido M.},
  issn         = {2835-8856},
  journal      = {Transactions on Machine Learning Research},
  publisher    = {Transactions on Machine Learning Research},
  title        = {{Continual learning: Applications and the road forward}},
  volume       = {2024},
  year         = {2024},
}

@article{19446,
  abstract     = {This Comment explores new approaches to enrich large-scale population data, including incorporating macro-environmental and digital health measures.},
  author       = {Nees, Frauke and Renner, Paul and Holz, Nathalie E. and Polemiti, Elli and Siehl, Sebastian and Hese, Sören and Schepanski, Kerstin and Schumann, Gunter and Walter, Henrik and Heinz, Andreas and Ralser, Markus and Twardziok, Sven and Vaidya, Nilakshi and Bernas, Antoine and Serin, Emin and Jentsch, Marcel and Hitchen, Esther and Kebir, Hedi and Lett, Tristram A. and Roy, Jean Charles and Eils, Roland and Taron, Ulrike Helene and Schütz, Tatjana and Banks, Jamie and Banaschewski, Tobias and Jansone, Karina and Christmann, Nina and Meyer-Lindenberg, Andreas and Tost, Heike and Holz, Nathalie and Schwarz, Emanuel and Stringaris, Argyris and Neidhart, Maja and Seefried, Beke and Aden, Rieke and Andreassen, Ole A. and Westlye, Lars T. and Van Der Meer, Dennis and Fernandez, Sara and Kjelkenes, Rikka and Ask, Helga and Rapp, Michael and Tschorn, Mira and Böttger, Sarah Jane and Marquand, Andre and Novarino, Gaia and Marr, Lena and Slater, Mel and Viapiana, Guillem Feixas and Orosa, Francisco Eiroa and Gallego, Jaime and Pastor, Alvaro and Forstner, Andreas J. and Hoffmann, Per and Nöthen, Markus M. and Claus, Isabelle and Miller, Abigail and Mathey, Carina M. and Heilmann-Heimbach, Stefanie and Sommer, Peter and Patraskaki, Myrto and Wilbertz, Johannes and Schmitt, Karen and Jirsa, Viktor and Petkoski, Spase and Pitel, Séverine and Otten, Lisa and Athanasiadis, Anastasios Polykarpos and Pearmund, Charlie and Spanlang, Bernhard and Alvarez, Elena and Sanchez, Mavi and Giner, Arantxa and Jia, Tianye and Gong, Yanting and Xia, Yunman and Chang, Xiao and Calhoun, Vince and Liu, Jingyu and Schwalber, Ameli and Thompson, Paul and Clinton, Nicholas and Desrivières, Sylvane and Young, Allan H. and Stahl, Bernd and Ogoh, George},
  issn         = {2731-6076},
  journal      = {Nature Mental Health},
  number       = {10},
  pages        = {1124--1127},
  publisher    = {Springer Nature},
  title        = {{Large-scale population data enrichment in mental health research}},
  doi          = {10.1038/s44220-024-00316-z},
  volume       = {2},
  year         = {2024},
}

@article{19470,
  abstract     = {When food is freely available, eating occurs without energy deficit. While agouti-related peptide (AgRP) neurons are likely involved, their activation is thought to require negative energy balance. To investigate this, we implemented long-term, continuous in vivo fiber-photometry recordings in mice. We discovered new forms of AgRP neuron regulation, including fast pre-ingestive decreases in activity and unexpectedly rapid activation by fasting. Furthermore, AgRP neuron activity has a circadian rhythm that peaks concurrent with the daily feeding onset. Importantly, this rhythm persists when nutrition is provided via constant-rate gastric infusions. Hence, it is not secondary to a circadian feeding rhythm. The AgRP neuron rhythm is driven by the circadian clock, the suprachiasmatic nucleus (SCN), as SCN ablation abolishes the circadian rhythm in AgRP neuron activity and feeding. The SCN activates AgRP neurons via excitatory afferents from thyrotrophin-releasing hormone-expressing neurons in the dorsomedial hypothalamus (DMHTrh neurons) to drive daily feeding rhythms.},
  author       = {Douglass, Amelia May Barnett and Kucukdereli, Hakan and Madara, Joseph C. and Wang, Daqing and Wu, Chen and Lowenstein, Elijah D. and Tao, Jenkang and Lowell, Bradford B.},
  issn         = {1550-4131},
  journal      = {Cell Metabolism},
  number       = {3},
  pages        = {708--722.e5},
  publisher    = {Elsevier},
  title        = {{Acute and circadian feedforward regulation of agouti-related peptide hunger neurons}},
  doi          = {10.1016/j.cmet.2024.11.009},
  volume       = {37},
  year         = {2024},
}

@article{19486,
  abstract     = {Consider the family of elliptic curves En:y2=x3+n2, where n varies over positive cubefree integers. There is a rational 3-isogeny ϕ from En to E^n:y2=x3−27n2 and a dual isogeny ϕ^:E^n→En. We show that for almost all n, the rank of Selϕ(En) is 0, and the rank of Selϕ^(E^n) is determined by the number of prime factors of n that are congruent to 2mod3 and the congruence class of nmod9.},
  author       = {Chan, Yik Tung},
  issn         = {1687-0247},
  journal      = {International Mathematics Research Notices},
  number       = {9},
  pages        = {7571--7593},
  publisher    = {Oxford University Press},
  title        = {{The 3-isogeny selmer groups of the elliptic curves y2=x3+n2}},
  doi          = {10.1093/imrn/rnad266},
  volume       = {2024},
  year         = {2024},
}

@inproceedings{19517,
  abstract     = {In this paper, we present a novel data-free method for merging neural networks in weight space. Differently from most existing works, our method optimizes for the permutations of network neurons globally across all layers. This allows us to enforce cycle consistency of the permutations when merging n ≥ 3 models, allowing circular compositions of permutations to be computed without accumulating error along the path. We qualitatively and quantitatively motivate the need for such a constraint, showing its benefits when merging sets of models in scenarios spanning varying architectures and datasets. We finally show that, when coupled
with activation renormalization, our approach yields the best results in the task.},
  author       = {Crisostomi, Donato and Fumero, Marco and Baieri, Daniele and Bernard, Florian and Rodolà, Emanuele},
  booktitle    = {38th Conference on Neural Information Processing Systems},
  issn         = {1049-5258},
  location     = {Vancouver, Canada},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{C2M3: Cycle-consistent multi-model merging}},
  volume       = {37},
  year         = {2024},
}

@inproceedings{19518,
  abstract     = {The rising footprint of machine learning has led to a focus on imposing model
sparsity as a means of reducing computational and memory costs. For deep neural
networks (DNNs), the state-of-the-art accuracy-vs-sparsity is achieved by heuristics
inspired by the classical Optimal Brain Surgeon (OBS) framework [LeCun et al.,
1989, Hassibi and Stork, 1992, Hassibi et al., 1993], which leverages loss curvature
information to make better pruning decisions. Yet, these results still lack a solid
theoretical understanding, and it is unclear whether they can be improved by
leveraging connections to the wealth of work on sparse recovery algorithms. In this
paper, we draw new connections between these two areas and present new sparse
recovery algorithms inspired by the OBS framework that comes with theoretical
guarantees under reasonable assumptions and have strong practical performance.
Specifically, our work starts from the observation that we can leverage curvature
information in OBS-like fashion upon the projection step of classic iterative sparse
recovery algorithms such as IHT. We show for the first time that this leads both
to improved convergence bounds under standard assumptions. Furthermore, we
present extensions of this approach to the practical task of obtaining accurate sparse
DNNs, and validate it experimentally at scale for Transformer-based models on
vision and language tasks.},
  author       = {Wu, Diyuan and Modoranu, Ionut-Vlad and Safaryan, Mher and Kuznedelev, Denis and Alistarh, Dan-Adrian},
  booktitle    = {38th Conference on Neural Information Processing Systems},
  issn         = {1049-5258},
  location     = {Vancouver, Canada},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{The iterative optimal brain surgeon: Faster sparse recovery by leveraging second-order information}},
  volume       = {37},
  year         = {2024},
}

@inproceedings{19519,
  abstract     = {There has been significant interest in "extreme" compression of large language models (LLMs), i.e. to 1-2 bits per parameter, which allows such models to be executed efficiently on resource-constrained devices. Existing work focused on improved one-shot quantization techniques and weight representations; yet, purely post-training approaches are reaching diminishing returns in terms of the accuracy-vs-bit-width trade-off. State-of-the-art quantization methods such as QuIP# and AQLM include fine-tuning (part of) the compressed parameters over a limited amount of calibration data; however, such fine-tuning techniques over compressed weights often make exclusive use of straight-through estimators (STE), whose performance is not well-understood in this setting. In this work, we question the use of STE for extreme LLM compression, showing that it can be sub-optimal, and perform a systematic study of quantization-aware fine-tuning strategies for LLMs.We propose PV-Tuning - a representation-agnostic framework that generalizes and improves upon existing fine-tuning strategies, and provides convergence guarantees in restricted cases.On the practical side, when used for 1-2 bit vector quantization, PV-Tuning outperforms prior techniques for highly-performant models such as Llama and Mistral. Using PV-Tuning, we achieve the first Pareto-optimal quantization for Llama-2 family models at 2 bits per parameter.},
  author       = {Malinovskii, Vladimir and Mazur, Denis and Ilin, Ivan and Kuznedelev, Denis and Burlachenko, Konstantin and Yi, Kai and Alistarh, Dan-Adrian and Richtarik, Peter},
  booktitle    = {38th Conference on Neural Information Processing Systems},
  isbn         = {9798331314385},
  issn         = {1049-5258},
  location     = {Vancouver, Canada},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{PV-tuning: Beyond straight-through estimation for extreme LLM compression}},
  volume       = {37},
  year         = {2024},
}

